./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 653a8e34239233d69d9a38d78b85981ab63654836b879da54ad0b88422f00ccf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:58:54,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:58:54,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:58:54,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:58:54,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:58:54,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:58:54,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:58:54,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:58:54,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:58:54,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:58:54,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:58:54,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:58:54,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:58:54,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:58:54,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:58:54,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:58:54,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:58:54,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:58:54,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:58:54,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:58:54,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:58:54,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:58:54,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:58:54,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:58:54,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:58:54,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:58:54,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:58:54,318 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/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 -> 653a8e34239233d69d9a38d78b85981ab63654836b879da54ad0b88422f00ccf [2025-03-16 19:58:54,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:58:54,528 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:58:54,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:58:54,531 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:58:54,531 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:58:54,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c [2025-03-16 19:58:55,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2b26031/0f0d457a00124a7cb77c3118f9b72e0a/FLAG22338ce18 [2025-03-16 19:58:56,280 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:58:56,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c [2025-03-16 19:58:56,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2b26031/0f0d457a00124a7cb77c3118f9b72e0a/FLAG22338ce18 [2025-03-16 19:58:56,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db2b26031/0f0d457a00124a7cb77c3118f9b72e0a [2025-03-16 19:58:56,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:58:56,759 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:58:56,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:58:56,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:58:56,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:58:56,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:58:56" (1/1) ... [2025-03-16 19:58:56,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b544826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:56, skipping insertion in model container [2025-03-16 19:58:56,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:58:56" (1/1) ... [2025-03-16 19:58:56,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:58:57,956 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c[381679,381692] [2025-03-16 19:58:57,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c[383339,383352] [2025-03-16 19:58:58,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:58:58,164 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:58:58,721 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c[381679,381692] [2025-03-16 19:58:58,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.06.cil-1.c[383339,383352] [2025-03-16 19:58:58,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:58:58,788 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:58:58,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58 WrapperNode [2025-03-16 19:58:58,790 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:58:58,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:58:58,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:58:58,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:58:58,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:58,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,193 INFO L138 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 12849 [2025-03-16 19:58:59,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:58:59,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:58:59,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:58:59,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:58:59,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,294 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-03-16 19:58:59,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,604 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:58:59,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:58:59,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:58:59,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:58:59,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (1/1) ... [2025-03-16 19:58:59,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:58:59,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:58:59,643 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:58:59,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:58:59,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:58:59,679 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:58:59,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:58:59,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:58:59,778 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:58:59,779 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:59:05,523 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:59:05,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:59:05,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:59:05,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:59:05,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:59:05,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:59:05,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:59:05,802 INFO L? ?]: Removed 1714 outVars from TransFormulas that were not future-live. [2025-03-16 19:59:05,802 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:59:05,859 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:59:05,860 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:59:05,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:59:05 BoogieIcfgContainer [2025-03-16 19:59:05,860 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:59:05,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:59:05,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:59:05,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:59:05,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:58:56" (1/3) ... [2025-03-16 19:59:05,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1257e693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:59:05, skipping insertion in model container [2025-03-16 19:59:05,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:58:58" (2/3) ... [2025-03-16 19:59:05,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1257e693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:59:05, skipping insertion in model container [2025-03-16 19:59:05,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:59:05" (3/3) ... [2025-03-16 19:59:05,867 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.06.cil-1.c [2025-03-16 19:59:05,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:59:05,884 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.06.cil-1.c that has 8 procedures, 2349 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-16 19:59:06,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:59:06,008 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;@146909fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:59:06,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:59:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 2349 states, 2318 states have (on average 1.873597929249353) internal successors, (4343), 2322 states have internal predecessors, (4343), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:59:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:06,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:06,035 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] [2025-03-16 19:59:06,035 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:06,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash 193653889, now seen corresponding path program 1 times [2025-03-16 19:59:06,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:06,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396426250] [2025-03-16 19:59:06,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:06,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:06,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:06,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:06,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:06,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:06,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396426250] [2025-03-16 19:59:06,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396426250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:06,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:06,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:59:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079342267] [2025-03-16 19:59:06,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:06,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:06,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:06,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:06,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:06,429 INFO L87 Difference]: Start difference. First operand has 2349 states, 2318 states have (on average 1.873597929249353) internal successors, (4343), 2322 states have internal predecessors, (4343), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:06,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:06,587 INFO L93 Difference]: Finished difference Result 4690 states and 8759 transitions. [2025-03-16 19:59:06,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:06,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:06,615 INFO L225 Difference]: With dead ends: 4690 [2025-03-16 19:59:06,615 INFO L226 Difference]: Without dead ends: 2342 [2025-03-16 19:59:06,625 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-03-16 19:59:06,629 INFO L435 NwaCegarLoop]: 4312 mSDtfsCounter, 344 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 8273 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-03-16 19:59:06,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 8273 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:06,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-16 19:59:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2342. [2025-03-16 19:59:06,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2342 states, 2312 states have (on average 1.8438581314878892) internal successors, (4263), 2315 states have internal predecessors, (4263), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 19:59:06,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2342 states to 2342 states and 4305 transitions. [2025-03-16 19:59:06,726 INFO L78 Accepts]: Start accepts. Automaton has 2342 states and 4305 transitions. Word has length 102 [2025-03-16 19:59:06,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:06,727 INFO L471 AbstractCegarLoop]: Abstraction has 2342 states and 4305 transitions. [2025-03-16 19:59:06,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2342 states and 4305 transitions. [2025-03-16 19:59:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:06,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:06,729 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] [2025-03-16 19:59:06,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:59:06,730 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash 207904034, now seen corresponding path program 1 times [2025-03-16 19:59:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762336639] [2025-03-16 19:59:06,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:06,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:06,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:06,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:06,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:06,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:06,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762336639] [2025-03-16 19:59:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762336639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:06,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:06,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:06,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831295884] [2025-03-16 19:59:06,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:06,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:06,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:06,980 INFO L87 Difference]: Start difference. First operand 2342 states and 4305 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:07,437 INFO L93 Difference]: Finished difference Result 2785 states and 5010 transitions. [2025-03-16 19:59:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:59:07,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:07,452 INFO L225 Difference]: With dead ends: 2785 [2025-03-16 19:59:07,452 INFO L226 Difference]: Without dead ends: 2576 [2025-03-16 19:59:07,454 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-03-16 19:59:07,455 INFO L435 NwaCegarLoop]: 4231 mSDtfsCounter, 4588 mSDsluCounter, 8601 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4602 SdHoareTripleChecker+Valid, 12832 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:07,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4602 Valid, 12832 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:59:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2576 states. [2025-03-16 19:59:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2576 to 2557. [2025-03-16 19:59:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2505 states have (on average 1.8255489021956088) internal successors, (4573), 2509 states have internal predecessors, (4573), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-16 19:59:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4646 transitions. [2025-03-16 19:59:07,529 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4646 transitions. Word has length 102 [2025-03-16 19:59:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:07,529 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4646 transitions. [2025-03-16 19:59:07,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4646 transitions. [2025-03-16 19:59:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:07,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:07,531 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] [2025-03-16 19:59:07,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:59:07,531 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:07,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 52145730, now seen corresponding path program 1 times [2025-03-16 19:59:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:07,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036918035] [2025-03-16 19:59:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:07,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:07,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:07,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:07,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:07,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:07,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036918035] [2025-03-16 19:59:07,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036918035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:07,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:07,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511896671] [2025-03-16 19:59:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:07,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:07,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:07,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:07,697 INFO L87 Difference]: Start difference. First operand 2557 states and 4646 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:08,000 INFO L93 Difference]: Finished difference Result 3023 states and 5396 transitions. [2025-03-16 19:59:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:08,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:08,010 INFO L225 Difference]: With dead ends: 3023 [2025-03-16 19:59:08,011 INFO L226 Difference]: Without dead ends: 2599 [2025-03-16 19:59:08,013 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-03-16 19:59:08,013 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4411 mSDsluCounter, 8343 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4425 SdHoareTripleChecker+Valid, 12564 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:08,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4425 Valid, 12564 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2599 states. [2025-03-16 19:59:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2599 to 2557. [2025-03-16 19:59:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2505 states have (on average 1.824750499001996) internal successors, (4571), 2509 states have internal predecessors, (4571), 37 states have call successors, (37), 13 states have call predecessors, (37), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-16 19:59:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4644 transitions. [2025-03-16 19:59:08,074 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4644 transitions. Word has length 102 [2025-03-16 19:59:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:08,075 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4644 transitions. [2025-03-16 19:59:08,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4644 transitions. [2025-03-16 19:59:08,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:08,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:08,076 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] [2025-03-16 19:59:08,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:59:08,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1220341985, now seen corresponding path program 1 times [2025-03-16 19:59:08,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:08,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583835674] [2025-03-16 19:59:08,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:08,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:08,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:08,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:08,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:08,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583835674] [2025-03-16 19:59:08,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583835674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:08,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:08,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:08,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756245638] [2025-03-16 19:59:08,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:08,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:08,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:08,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:08,237 INFO L87 Difference]: Start difference. First operand 2557 states and 4644 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:08,729 INFO L93 Difference]: Finished difference Result 3251 states and 5749 transitions. [2025-03-16 19:59:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:08,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:08,740 INFO L225 Difference]: With dead ends: 3251 [2025-03-16 19:59:08,740 INFO L226 Difference]: Without dead ends: 2827 [2025-03-16 19:59:08,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:08,743 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4577 mSDsluCounter, 13240 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4591 SdHoareTripleChecker+Valid, 17654 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:08,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4591 Valid, 17654 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2025-03-16 19:59:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2756. [2025-03-16 19:59:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2682 states have (on average 1.807606263982103) internal successors, (4848), 2687 states have internal predecessors, (4848), 52 states have call successors, (52), 19 states have call predecessors, (52), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-16 19:59:08,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 4954 transitions. [2025-03-16 19:59:08,808 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 4954 transitions. Word has length 102 [2025-03-16 19:59:08,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:08,808 INFO L471 AbstractCegarLoop]: Abstraction has 2756 states and 4954 transitions. [2025-03-16 19:59:08,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 4954 transitions. [2025-03-16 19:59:08,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:08,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:08,810 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] [2025-03-16 19:59:08,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:59:08,810 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:08,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:08,810 INFO L85 PathProgramCache]: Analyzing trace with hash 11099746, now seen corresponding path program 1 times [2025-03-16 19:59:08,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:08,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009546284] [2025-03-16 19:59:08,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:08,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:08,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:08,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:08,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:08,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:08,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009546284] [2025-03-16 19:59:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009546284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:08,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646255517] [2025-03-16 19:59:08,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:08,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:08,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:08,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:08,949 INFO L87 Difference]: Start difference. First operand 2756 states and 4954 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:09,488 INFO L93 Difference]: Finished difference Result 3879 states and 6740 transitions. [2025-03-16 19:59:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:09,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:09,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:09,501 INFO L225 Difference]: With dead ends: 3879 [2025-03-16 19:59:09,502 INFO L226 Difference]: Without dead ends: 3256 [2025-03-16 19:59:09,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:09,505 INFO L435 NwaCegarLoop]: 4410 mSDtfsCounter, 4572 mSDsluCounter, 13228 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4586 SdHoareTripleChecker+Valid, 17638 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:09,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4586 Valid, 17638 Invalid, 701 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2025-03-16 19:59:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3177. [2025-03-16 19:59:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3057 states have (on average 1.77984952567877) internal successors, (5441), 3066 states have internal predecessors, (5441), 82 states have call successors, (82), 31 states have call predecessors, (82), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-16 19:59:09,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 5619 transitions. [2025-03-16 19:59:09,608 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 5619 transitions. Word has length 102 [2025-03-16 19:59:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:09,608 INFO L471 AbstractCegarLoop]: Abstraction has 3177 states and 5619 transitions. [2025-03-16 19:59:09,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:09,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 5619 transitions. [2025-03-16 19:59:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:09,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:09,610 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] [2025-03-16 19:59:09,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:59:09,612 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:09,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1219017921, now seen corresponding path program 1 times [2025-03-16 19:59:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:09,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878128895] [2025-03-16 19:59:09,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:09,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:09,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:09,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:09,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:09,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878128895] [2025-03-16 19:59:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878128895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490085962] [2025-03-16 19:59:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:09,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:09,746 INFO L87 Difference]: Start difference. First operand 3177 states and 5619 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:10,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:10,313 INFO L93 Difference]: Finished difference Result 5222 states and 8899 transitions. [2025-03-16 19:59:10,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:10,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:10,331 INFO L225 Difference]: With dead ends: 5222 [2025-03-16 19:59:10,331 INFO L226 Difference]: Without dead ends: 4178 [2025-03-16 19:59:10,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:10,336 INFO L435 NwaCegarLoop]: 4407 mSDtfsCounter, 4567 mSDsluCounter, 13219 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 17626 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:10,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 17626 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4178 states. [2025-03-16 19:59:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4178 to 4082. [2025-03-16 19:59:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4082 states, 3864 states have (on average 1.7424948240165632) internal successors, (6733), 3887 states have internal predecessors, (6733), 142 states have call successors, (142), 55 states have call predecessors, (142), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-16 19:59:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4082 states to 4082 states and 7079 transitions. [2025-03-16 19:59:10,503 INFO L78 Accepts]: Start accepts. Automaton has 4082 states and 7079 transitions. Word has length 102 [2025-03-16 19:59:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:10,503 INFO L471 AbstractCegarLoop]: Abstraction has 4082 states and 7079 transitions. [2025-03-16 19:59:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 4082 states and 7079 transitions. [2025-03-16 19:59:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:10,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:10,505 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] [2025-03-16 19:59:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:59:10,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -266037630, now seen corresponding path program 1 times [2025-03-16 19:59:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463092363] [2025-03-16 19:59:10,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:10,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:10,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:10,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:10,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463092363] [2025-03-16 19:59:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463092363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894391356] [2025-03-16 19:59:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:10,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:10,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:10,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:10,620 INFO L87 Difference]: Start difference. First operand 4082 states and 7079 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:11,222 INFO L93 Difference]: Finished difference Result 8141 states and 13725 transitions. [2025-03-16 19:59:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:11,258 INFO L225 Difference]: With dead ends: 8141 [2025-03-16 19:59:11,260 INFO L226 Difference]: Without dead ends: 6192 [2025-03-16 19:59:11,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:11,269 INFO L435 NwaCegarLoop]: 4404 mSDtfsCounter, 4562 mSDsluCounter, 13210 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4576 SdHoareTripleChecker+Valid, 17614 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:11,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4576 Valid, 17614 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:11,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6192 states. [2025-03-16 19:59:11,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6192 to 6063. [2025-03-16 19:59:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6063 states, 5631 states have (on average 1.7050257503107795) internal successors, (9601), 5700 states have internal predecessors, (9601), 262 states have call successors, (262), 103 states have call predecessors, (262), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-16 19:59:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6063 states to 6063 states and 10379 transitions. [2025-03-16 19:59:11,547 INFO L78 Accepts]: Start accepts. Automaton has 6063 states and 10379 transitions. Word has length 102 [2025-03-16 19:59:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:11,548 INFO L471 AbstractCegarLoop]: Abstraction has 6063 states and 10379 transitions. [2025-03-16 19:59:11,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:11,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6063 states and 10379 transitions. [2025-03-16 19:59:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:11,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:11,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:11,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:59:11,557 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash 517341345, now seen corresponding path program 1 times [2025-03-16 19:59:11,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:11,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47902759] [2025-03-16 19:59:11,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:11,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:11,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:11,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:11,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:11,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47902759] [2025-03-16 19:59:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47902759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:11,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120879949] [2025-03-16 19:59:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:11,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:11,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:11,698 INFO L87 Difference]: Start difference. First operand 6063 states and 10379 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:12,270 INFO L93 Difference]: Finished difference Result 14604 states and 24879 transitions. [2025-03-16 19:59:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:12,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:12,308 INFO L225 Difference]: With dead ends: 14604 [2025-03-16 19:59:12,310 INFO L226 Difference]: Without dead ends: 10674 [2025-03-16 19:59:12,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:12,326 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4584 mSDsluCounter, 12827 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4598 SdHoareTripleChecker+Valid, 17067 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:12,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4598 Valid, 17067 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:59:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2025-03-16 19:59:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10484. [2025-03-16 19:59:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10484 states, 9570 states have (on average 1.680773249738767) internal successors, (16085), 9785 states have internal predecessors, (16085), 502 states have call successors, (502), 199 states have call predecessors, (502), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-16 19:59:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10484 states to 10484 states and 18111 transitions. [2025-03-16 19:59:12,673 INFO L78 Accepts]: Start accepts. Automaton has 10484 states and 18111 transitions. Word has length 102 [2025-03-16 19:59:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:12,673 INFO L471 AbstractCegarLoop]: Abstraction has 10484 states and 18111 transitions. [2025-03-16 19:59:12,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 10484 states and 18111 transitions. [2025-03-16 19:59:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:12,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:12,682 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] [2025-03-16 19:59:12,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:59:12,682 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:12,683 INFO L85 PathProgramCache]: Analyzing trace with hash -11577694, now seen corresponding path program 1 times [2025-03-16 19:59:12,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:12,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410269704] [2025-03-16 19:59:12,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:12,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:12,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:12,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:12,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410269704] [2025-03-16 19:59:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410269704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:12,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:12,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58284735] [2025-03-16 19:59:12,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:12,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:12,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:12,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:12,787 INFO L87 Difference]: Start difference. First operand 10484 states and 18111 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:13,681 INFO L93 Difference]: Finished difference Result 30471 states and 53806 transitions. [2025-03-16 19:59:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:13,779 INFO L225 Difference]: With dead ends: 30471 [2025-03-16 19:59:13,779 INFO L226 Difference]: Without dead ends: 22120 [2025-03-16 19:59:13,821 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-03-16 19:59:13,822 INFO L435 NwaCegarLoop]: 4396 mSDtfsCounter, 4725 mSDsluCounter, 13181 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4746 SdHoareTripleChecker+Valid, 17577 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:13,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4746 Valid, 17577 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:59:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22120 states. [2025-03-16 19:59:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22120 to 20445. [2025-03-16 19:59:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20445 states, 18437 states have (on average 1.6768997125345773) internal successors, (30917), 19106 states have internal predecessors, (30917), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-16 19:59:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20445 states to 20445 states and 36911 transitions. [2025-03-16 19:59:14,719 INFO L78 Accepts]: Start accepts. Automaton has 20445 states and 36911 transitions. Word has length 102 [2025-03-16 19:59:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:14,720 INFO L471 AbstractCegarLoop]: Abstraction has 20445 states and 36911 transitions. [2025-03-16 19:59:14,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20445 states and 36911 transitions. [2025-03-16 19:59:14,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:14,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:14,731 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] [2025-03-16 19:59:14,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:59:14,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:14,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash -582828927, now seen corresponding path program 1 times [2025-03-16 19:59:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283939141] [2025-03-16 19:59:14,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:14,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:14,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:14,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:14,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:14,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283939141] [2025-03-16 19:59:14,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283939141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:14,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:14,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:14,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568365168] [2025-03-16 19:59:14,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:14,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:14,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:14,825 INFO L87 Difference]: Start difference. First operand 20445 states and 36911 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:15,866 INFO L93 Difference]: Finished difference Result 43874 states and 82113 transitions. [2025-03-16 19:59:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:15,953 INFO L225 Difference]: With dead ends: 43874 [2025-03-16 19:59:15,953 INFO L226 Difference]: Without dead ends: 25562 [2025-03-16 19:59:15,987 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-03-16 19:59:15,988 INFO L435 NwaCegarLoop]: 4206 mSDtfsCounter, 4400 mSDsluCounter, 8312 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4414 SdHoareTripleChecker+Valid, 12518 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:15,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4414 Valid, 12518 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:16,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25562 states. [2025-03-16 19:59:16,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25562 to 20445. [2025-03-16 19:59:16,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20445 states, 18437 states have (on average 1.6733741931984596) internal successors, (30852), 19106 states have internal predecessors, (30852), 950 states have call successors, (950), 391 states have call predecessors, (950), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-16 19:59:16,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20445 states to 20445 states and 36846 transitions. [2025-03-16 19:59:16,909 INFO L78 Accepts]: Start accepts. Automaton has 20445 states and 36846 transitions. Word has length 102 [2025-03-16 19:59:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:16,910 INFO L471 AbstractCegarLoop]: Abstraction has 20445 states and 36846 transitions. [2025-03-16 19:59:16,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 20445 states and 36846 transitions. [2025-03-16 19:59:16,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:16,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:16,919 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] [2025-03-16 19:59:16,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:59:16,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:16,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -462709054, now seen corresponding path program 1 times [2025-03-16 19:59:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:16,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788483623] [2025-03-16 19:59:16,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:16,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:16,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:16,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:16,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:17,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788483623] [2025-03-16 19:59:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788483623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:17,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:17,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:17,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643322778] [2025-03-16 19:59:17,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:17,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:17,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:17,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:17,021 INFO L87 Difference]: Start difference. First operand 20445 states and 36846 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:18,500 INFO L93 Difference]: Finished difference Result 63418 states and 120633 transitions. [2025-03-16 19:59:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:18,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:18,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:18,707 INFO L225 Difference]: With dead ends: 63418 [2025-03-16 19:59:18,707 INFO L226 Difference]: Without dead ends: 45106 [2025-03-16 19:59:18,872 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-03-16 19:59:18,874 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4577 mSDsluCounter, 13158 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4590 SdHoareTripleChecker+Valid, 17546 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:18,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4590 Valid, 17546 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45106 states. [2025-03-16 19:59:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45106 to 42701. [2025-03-16 19:59:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42701 states, 38051 states have (on average 1.6755932826995348) internal successors, (63758), 40114 states have internal predecessors, (63758), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 19:59:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42701 states to 42701 states and 83768 transitions. [2025-03-16 19:59:21,393 INFO L78 Accepts]: Start accepts. Automaton has 42701 states and 83768 transitions. Word has length 102 [2025-03-16 19:59:21,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:21,393 INFO L471 AbstractCegarLoop]: Abstraction has 42701 states and 83768 transitions. [2025-03-16 19:59:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:21,394 INFO L276 IsEmpty]: Start isEmpty. Operand 42701 states and 83768 transitions. [2025-03-16 19:59:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:21,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:21,416 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] [2025-03-16 19:59:21,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:59:21,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:21,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash -43192223, now seen corresponding path program 1 times [2025-03-16 19:59:21,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:21,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733346626] [2025-03-16 19:59:21,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:21,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:21,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:21,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:21,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:21,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733346626] [2025-03-16 19:59:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733346626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:21,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:21,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:21,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100839948] [2025-03-16 19:59:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:21,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:21,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:21,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:21,505 INFO L87 Difference]: Start difference. First operand 42701 states and 83768 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:23,722 INFO L93 Difference]: Finished difference Result 94214 states and 195525 transitions. [2025-03-16 19:59:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:24,014 INFO L225 Difference]: With dead ends: 94214 [2025-03-16 19:59:24,014 INFO L226 Difference]: Without dead ends: 53646 [2025-03-16 19:59:24,309 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-03-16 19:59:24,311 INFO L435 NwaCegarLoop]: 4201 mSDtfsCounter, 4396 mSDsluCounter, 8303 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4410 SdHoareTripleChecker+Valid, 12504 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:24,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4410 Valid, 12504 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53646 states. [2025-03-16 19:59:27,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53646 to 42701. [2025-03-16 19:59:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42701 states, 38051 states have (on average 1.67220309584505) internal successors, (63629), 40114 states have internal predecessors, (63629), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 19:59:27,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42701 states to 42701 states and 83639 transitions. [2025-03-16 19:59:27,948 INFO L78 Accepts]: Start accepts. Automaton has 42701 states and 83639 transitions. Word has length 102 [2025-03-16 19:59:27,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:27,948 INFO L471 AbstractCegarLoop]: Abstraction has 42701 states and 83639 transitions. [2025-03-16 19:59:27,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:27,949 INFO L276 IsEmpty]: Start isEmpty. Operand 42701 states and 83639 transitions. [2025-03-16 19:59:27,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:27,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:27,965 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] [2025-03-16 19:59:27,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:59:27,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:27,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:27,965 INFO L85 PathProgramCache]: Analyzing trace with hash -29659422, now seen corresponding path program 1 times [2025-03-16 19:59:27,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:27,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369266457] [2025-03-16 19:59:27,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:27,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:27,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:27,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:27,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:27,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:28,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369266457] [2025-03-16 19:59:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369266457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:28,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:28,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:28,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461668387] [2025-03-16 19:59:28,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:28,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:28,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:28,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:28,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:28,036 INFO L87 Difference]: Start difference. First operand 42701 states and 83639 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:30,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:30,205 INFO L93 Difference]: Finished difference Result 92025 states and 190889 transitions. [2025-03-16 19:59:30,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:30,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 102 [2025-03-16 19:59:30,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:30,470 INFO L225 Difference]: With dead ends: 92025 [2025-03-16 19:59:30,470 INFO L226 Difference]: Without dead ends: 51457 [2025-03-16 19:59:30,579 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-03-16 19:59:30,580 INFO L435 NwaCegarLoop]: 4198 mSDtfsCounter, 4393 mSDsluCounter, 8298 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4407 SdHoareTripleChecker+Valid, 12496 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:30,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4407 Valid, 12496 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:59:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51457 states. [2025-03-16 19:59:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51457 to 42701. [2025-03-16 19:59:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42701 states, 38051 states have (on average 1.6688129089905652) internal successors, (63500), 40114 states have internal predecessors, (63500), 1814 states have call successors, (1814), 775 states have call predecessors, (1814), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 19:59:33,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42701 states to 42701 states and 83510 transitions. [2025-03-16 19:59:33,892 INFO L78 Accepts]: Start accepts. Automaton has 42701 states and 83510 transitions. Word has length 102 [2025-03-16 19:59:33,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:33,892 INFO L471 AbstractCegarLoop]: Abstraction has 42701 states and 83510 transitions. [2025-03-16 19:59:33,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 42701 states and 83510 transitions. [2025-03-16 19:59:33,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 19:59:33,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:33,909 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] [2025-03-16 19:59:33,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:59:33,909 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:33,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1079155777, now seen corresponding path program 1 times [2025-03-16 19:59:33,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:33,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744123827] [2025-03-16 19:59:33,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:33,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 19:59:33,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 19:59:33,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:33,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744123827] [2025-03-16 19:59:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744123827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:34,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525145527] [2025-03-16 19:59:34,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:34,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:34,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:34,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:34,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:34,005 INFO L87 Difference]: Start difference. First operand 42701 states and 83510 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)