./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.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_label41+token_ring.06.cil-2.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 b643fcd36e1cc4587225d57a08c62d9a71f0676d69600864fd61c6c0403013f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:55:55,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:55:55,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:55:55,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:55:55,540 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:55:55,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:55:55,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:55:55,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:55:55,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:55:55,561 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:55:55,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:55:55,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:55:55,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:55:55,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:55:55,562 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:55:55,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:55:55,563 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:55:55,563 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:55:55,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:55:55,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:55:55,564 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 -> b643fcd36e1cc4587225d57a08c62d9a71f0676d69600864fd61c6c0403013f3 [2025-03-16 19:55:55,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:55:55,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:55:55,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:55:55,781 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:55:55,781 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:55:55,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.c [2025-03-16 19:55:56,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327e69e52/39880bc3de574838850ecb068c7bc961/FLAGdcfc4e5b4 [2025-03-16 19:55:57,455 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:55:57,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.06.cil-2.c [2025-03-16 19:55:57,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327e69e52/39880bc3de574838850ecb068c7bc961/FLAGdcfc4e5b4 [2025-03-16 19:55:57,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/327e69e52/39880bc3de574838850ecb068c7bc961 [2025-03-16 19:55:57,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:55:57,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:55:57,520 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:55:57,520 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:55:57,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:55:57,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:55:57" (1/1) ... [2025-03-16 19:55:57,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170fa4e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:57, skipping insertion in model container [2025-03-16 19:55:57,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:55:57" (1/1) ... [2025-03-16 19:55:57,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:55:58,718 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_label41+token_ring.06.cil-2.c[376251,376264] [2025-03-16 19:55:58,749 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_label41+token_ring.06.cil-2.c[383339,383352] [2025-03-16 19:55:58,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:55:58,945 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:55:59,438 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_label41+token_ring.06.cil-2.c[376251,376264] [2025-03-16 19:55:59,445 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_label41+token_ring.06.cil-2.c[383339,383352] [2025-03-16 19:55:59,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:55:59,503 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:55:59,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59 WrapperNode [2025-03-16 19:55:59,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:55:59,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:55:59,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:55:59,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:55:59,510 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:55:59" (1/1) ... [2025-03-16 19:55:59,562 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:55:59" (1/1) ... [2025-03-16 19:55:59,890 INFO L138 Inliner]: procedures = 56, calls = 59, calls flagged for inlining = 34, calls inlined = 34, statements flattened = 12843 [2025-03-16 19:55:59,891 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:55:59,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:55:59,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:55:59,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:55:59,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:55:59,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:55:59,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,037 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:56:00,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:56:00,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:56:00,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:56:00,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:56:00,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (1/1) ... [2025-03-16 19:56:00,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:56:00,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:56:00,401 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:56:00,430 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:56:00,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:56:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:56:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:56:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:56:00,449 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:56:00,449 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:56:00,450 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:56:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:56:00,450 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:56:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:56:00,450 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:56:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:56:00,450 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:56:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:56:00,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:56:00,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:56:00,533 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:56:00,534 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:56:06,500 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:56:06,500 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:56:06,501 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:56:06,501 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:56:06,501 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:56:06,501 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:56:06,501 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:56:06,695 INFO L? ?]: Removed 1710 outVars from TransFormulas that were not future-live. [2025-03-16 19:56:06,695 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:56:06,752 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:56:06,757 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:56:06,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:56:06 BoogieIcfgContainer [2025-03-16 19:56:06,757 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:56:06,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:56:06,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:56:06,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:56:06,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:55:57" (1/3) ... [2025-03-16 19:56:06,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20687b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:56:06, skipping insertion in model container [2025-03-16 19:56:06,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:55:59" (2/3) ... [2025-03-16 19:56:06,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20687b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:56:06, skipping insertion in model container [2025-03-16 19:56:06,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:56:06" (3/3) ... [2025-03-16 19:56:06,766 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.06.cil-2.c [2025-03-16 19:56:06,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:56:06,779 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.06.cil-2.c that has 7 procedures, 2340 locations, 1 initial locations, 10 loop locations, and 2 error locations. [2025-03-16 19:56:06,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:56:06,898 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;@5d3718c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:56:06,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:56:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 2340 states, 2312 states have (on average 1.8737024221453287) internal successors, (4332), 2314 states have internal predecessors, (4332), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-16 19:56:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:06,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:06,925 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] [2025-03-16 19:56:06,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:06,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1793465467, now seen corresponding path program 1 times [2025-03-16 19:56:06,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:06,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401817047] [2025-03-16 19:56:06,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:06,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:07,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:07,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:07,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:07,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:07,421 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:56:07,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:07,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401817047] [2025-03-16 19:56:07,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401817047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:07,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:07,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:56:07,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387464282] [2025-03-16 19:56:07,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:07,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:56:07,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:07,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:56:07,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:56:07,457 INFO L87 Difference]: Start difference. First operand has 2340 states, 2312 states have (on average 1.8737024221453287) internal successors, (4332), 2314 states have internal predecessors, (4332), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:08,040 INFO L93 Difference]: Finished difference Result 4898 states and 9101 transitions. [2025-03-16 19:56:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:56:08,043 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:08,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:08,077 INFO L225 Difference]: With dead ends: 4898 [2025-03-16 19:56:08,077 INFO L226 Difference]: Without dead ends: 2562 [2025-03-16 19:56:08,087 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:56:08,091 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4581 mSDsluCounter, 8594 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4595 SdHoareTripleChecker+Valid, 12823 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:08,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4595 Valid, 12823 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2025-03-16 19:56:08,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2545. [2025-03-16 19:56:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2495 states have (on average 1.825250501002004) internal successors, (4554), 2498 states have internal predecessors, (4554), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-16 19:56:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4625 transitions. [2025-03-16 19:56:08,260 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4625 transitions. Word has length 101 [2025-03-16 19:56:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:08,261 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4625 transitions. [2025-03-16 19:56:08,261 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4625 transitions. [2025-03-16 19:56:08,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:08,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:08,268 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] [2025-03-16 19:56:08,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:56:08,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:08,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash -982505637, now seen corresponding path program 1 times [2025-03-16 19:56:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066101258] [2025-03-16 19:56:08,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:08,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:08,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:08,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:08,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:08,476 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:56:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:08,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066101258] [2025-03-16 19:56:08,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066101258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:56:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123917253] [2025-03-16 19:56:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:08,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:56:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:08,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:56:08,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:56:08,480 INFO L87 Difference]: Start difference. First operand 2545 states and 4625 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:08,745 INFO L93 Difference]: Finished difference Result 2999 states and 5353 transitions. [2025-03-16 19:56:08,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:56:08,746 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:08,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:08,755 INFO L225 Difference]: With dead ends: 2999 [2025-03-16 19:56:08,755 INFO L226 Difference]: Without dead ends: 2587 [2025-03-16 19:56:08,757 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:56:08,758 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4399 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4413 SdHoareTripleChecker+Valid, 12538 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:08,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4413 Valid, 12538 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:56:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-03-16 19:56:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 2545. [2025-03-16 19:56:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2545 states, 2495 states have (on average 1.8244488977955913) internal successors, (4552), 2498 states have internal predecessors, (4552), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (36), 35 states have call predecessors, (36), 35 states have call successors, (36) [2025-03-16 19:56:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 4623 transitions. [2025-03-16 19:56:08,818 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 4623 transitions. Word has length 101 [2025-03-16 19:56:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:08,818 INFO L471 AbstractCegarLoop]: Abstraction has 2545 states and 4623 transitions. [2025-03-16 19:56:08,818 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 4623 transitions. [2025-03-16 19:56:08,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:08,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:08,819 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] [2025-03-16 19:56:08,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:56:08,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:08,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:08,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2103219420, now seen corresponding path program 1 times [2025-03-16 19:56:08,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:08,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512945923] [2025-03-16 19:56:08,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:08,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:08,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:08,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:08,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:09,007 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:56:09,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:09,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512945923] [2025-03-16 19:56:09,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512945923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:09,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:09,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:09,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198538835] [2025-03-16 19:56:09,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:09,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:09,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:09,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:09,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:09,009 INFO L87 Difference]: Start difference. First operand 2545 states and 4623 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:09,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:09,755 INFO L93 Difference]: Finished difference Result 3220 states and 5694 transitions. [2025-03-16 19:56:09,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:09,755 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:09,766 INFO L225 Difference]: With dead ends: 3220 [2025-03-16 19:56:09,767 INFO L226 Difference]: Without dead ends: 2808 [2025-03-16 19:56:09,769 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:56:09,770 INFO L435 NwaCegarLoop]: 4393 mSDtfsCounter, 4565 mSDsluCounter, 13178 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 17571 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:09,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 17571 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:56:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2025-03-16 19:56:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2739. [2025-03-16 19:56:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 2667 states have (on average 1.806899137607799) internal successors, (4819), 2671 states have internal predecessors, (4819), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (54), 51 states have call predecessors, (54), 50 states have call successors, (54) [2025-03-16 19:56:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4923 transitions. [2025-03-16 19:56:09,839 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4923 transitions. Word has length 101 [2025-03-16 19:56:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:09,840 INFO L471 AbstractCegarLoop]: Abstraction has 2739 states and 4923 transitions. [2025-03-16 19:56:09,840 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4923 transitions. [2025-03-16 19:56:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:09,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:09,841 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] [2025-03-16 19:56:09,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:56:09,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:09,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash -983829701, now seen corresponding path program 1 times [2025-03-16 19:56:09,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755646703] [2025-03-16 19:56:09,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:09,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:09,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:09,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:09,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:09,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:09,990 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:56:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755646703] [2025-03-16 19:56:09,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755646703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:09,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599589917] [2025-03-16 19:56:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:09,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:09,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:09,992 INFO L87 Difference]: Start difference. First operand 2739 states and 4923 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:10,472 INFO L93 Difference]: Finished difference Result 3833 states and 6655 transitions. [2025-03-16 19:56:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:10,473 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:10,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:10,487 INFO L225 Difference]: With dead ends: 3833 [2025-03-16 19:56:10,488 INFO L226 Difference]: Without dead ends: 3227 [2025-03-16 19:56:10,491 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:56:10,493 INFO L435 NwaCegarLoop]: 4389 mSDtfsCounter, 4560 mSDsluCounter, 13166 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 17555 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:10,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 17555 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3227 states. [2025-03-16 19:56:10,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3227 to 3150. [2025-03-16 19:56:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3150 states, 3032 states have (on average 1.7783641160949868) internal successors, (5392), 3040 states have internal predecessors, (5392), 80 states have call successors, (80), 30 states have call predecessors, (80), 36 states have return successors, (96), 83 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-16 19:56:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3150 states to 3150 states and 5568 transitions. [2025-03-16 19:56:10,571 INFO L78 Accepts]: Start accepts. Automaton has 3150 states and 5568 transitions. Word has length 101 [2025-03-16 19:56:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:10,571 INFO L471 AbstractCegarLoop]: Abstraction has 3150 states and 5568 transitions. [2025-03-16 19:56:10,572 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3150 states and 5568 transitions. [2025-03-16 19:56:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:10,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:10,573 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] [2025-03-16 19:56:10,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:56:10,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:10,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:10,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1826082044, now seen corresponding path program 1 times [2025-03-16 19:56:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136058874] [2025-03-16 19:56:10,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:10,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:10,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:10,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:10,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:10,734 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:56:10,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:10,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136058874] [2025-03-16 19:56:10,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136058874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:10,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:10,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:10,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977806579] [2025-03-16 19:56:10,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:10,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:10,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:10,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:10,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:10,736 INFO L87 Difference]: Start difference. First operand 3150 states and 5568 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:11,219 INFO L93 Difference]: Finished difference Result 5146 states and 8754 transitions. [2025-03-16 19:56:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:11,220 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:11,238 INFO L225 Difference]: With dead ends: 5146 [2025-03-16 19:56:11,239 INFO L226 Difference]: Without dead ends: 4129 [2025-03-16 19:56:11,243 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:56:11,245 INFO L435 NwaCegarLoop]: 4386 mSDtfsCounter, 4555 mSDsluCounter, 13157 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 17543 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:11,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 17543 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:11,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4129 states. [2025-03-16 19:56:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4129 to 4035. [2025-03-16 19:56:11,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4035 states, 3819 states have (on average 1.7397224404294318) internal successors, (6644), 3841 states have internal predecessors, (6644), 140 states have call successors, (140), 54 states have call predecessors, (140), 74 states have return successors, (204), 147 states have call predecessors, (204), 140 states have call successors, (204) [2025-03-16 19:56:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 6988 transitions. [2025-03-16 19:56:11,364 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 6988 transitions. Word has length 101 [2025-03-16 19:56:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:11,364 INFO L471 AbstractCegarLoop]: Abstraction has 4035 states and 6988 transitions. [2025-03-16 19:56:11,365 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 6988 transitions. [2025-03-16 19:56:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:11,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:11,370 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] [2025-03-16 19:56:11,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:56:11,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:11,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:11,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1685506277, now seen corresponding path program 1 times [2025-03-16 19:56:11,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:11,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613182366] [2025-03-16 19:56:11,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:11,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:11,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:11,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:11,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:11,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:11,482 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:56:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613182366] [2025-03-16 19:56:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613182366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:11,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:11,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438265166] [2025-03-16 19:56:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:11,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:11,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:11,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:11,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:11,484 INFO L87 Difference]: Start difference. First operand 4035 states and 6988 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:12,056 INFO L93 Difference]: Finished difference Result 8005 states and 13460 transitions. [2025-03-16 19:56:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:12,056 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:12,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:12,077 INFO L225 Difference]: With dead ends: 8005 [2025-03-16 19:56:12,077 INFO L226 Difference]: Without dead ends: 6103 [2025-03-16 19:56:12,082 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:56:12,083 INFO L435 NwaCegarLoop]: 4383 mSDtfsCounter, 4550 mSDsluCounter, 13148 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4564 SdHoareTripleChecker+Valid, 17531 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:12,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4564 Valid, 17531 Invalid, 684 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6103 states. [2025-03-16 19:56:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6103 to 5976. [2025-03-16 19:56:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5976 states, 5546 states have (on average 1.700685178507032) internal successors, (9432), 5614 states have internal predecessors, (9432), 260 states have call successors, (260), 102 states have call predecessors, (260), 168 states have return successors, (516), 275 states have call predecessors, (516), 260 states have call successors, (516) [2025-03-16 19:56:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5976 states to 5976 states and 10208 transitions. [2025-03-16 19:56:12,237 INFO L78 Accepts]: Start accepts. Automaton has 5976 states and 10208 transitions. Word has length 101 [2025-03-16 19:56:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:12,237 INFO L471 AbstractCegarLoop]: Abstraction has 5976 states and 10208 transitions. [2025-03-16 19:56:12,238 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:12,238 INFO L276 IsEmpty]: Start isEmpty. Operand 5976 states and 10208 transitions. [2025-03-16 19:56:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:12,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:12,243 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] [2025-03-16 19:56:12,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:56:12,243 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:12,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:12,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2080541980, now seen corresponding path program 1 times [2025-03-16 19:56:12,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:12,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629111450] [2025-03-16 19:56:12,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:12,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:12,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:12,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:12,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:12,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:56:12,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:12,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629111450] [2025-03-16 19:56:12,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629111450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:12,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313975413] [2025-03-16 19:56:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:12,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:12,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:12,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:12,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:12,357 INFO L87 Difference]: Start difference. First operand 5976 states and 10208 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:13,073 INFO L93 Difference]: Finished difference Result 14348 states and 24374 transitions. [2025-03-16 19:56:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:13,073 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:13,144 INFO L225 Difference]: With dead ends: 14348 [2025-03-16 19:56:13,144 INFO L226 Difference]: Without dead ends: 10505 [2025-03-16 19:56:13,158 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:56:13,159 INFO L435 NwaCegarLoop]: 4230 mSDtfsCounter, 4571 mSDsluCounter, 12792 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4585 SdHoareTripleChecker+Valid, 17022 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:13,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4585 Valid, 17022 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10505 states. [2025-03-16 19:56:13,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10505 to 10317. [2025-03-16 19:56:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10317 states, 9405 states have (on average 1.6752791068580541) internal successors, (15756), 9619 states have internal predecessors, (15756), 500 states have call successors, (500), 198 states have call predecessors, (500), 410 states have return successors, (1524), 531 states have call predecessors, (1524), 500 states have call successors, (1524) [2025-03-16 19:56:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10317 states to 10317 states and 17780 transitions. [2025-03-16 19:56:13,520 INFO L78 Accepts]: Start accepts. Automaton has 10317 states and 17780 transitions. Word has length 101 [2025-03-16 19:56:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:13,520 INFO L471 AbstractCegarLoop]: Abstraction has 10317 states and 17780 transitions. [2025-03-16 19:56:13,521 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 10317 states and 17780 transitions. [2025-03-16 19:56:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:13,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:13,527 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] [2025-03-16 19:56:13,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:56:13,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:13,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:13,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1509290747, now seen corresponding path program 1 times [2025-03-16 19:56:13,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:13,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949495082] [2025-03-16 19:56:13,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:13,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:13,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:13,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:13,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:13,630 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:56:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949495082] [2025-03-16 19:56:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949495082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:13,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:13,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:13,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842242781] [2025-03-16 19:56:13,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:13,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:13,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:13,632 INFO L87 Difference]: Start difference. First operand 10317 states and 17780 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:14,569 INFO L93 Difference]: Finished difference Result 29975 states and 52821 transitions. [2025-03-16 19:56:14,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:14,570 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:14,694 INFO L225 Difference]: With dead ends: 29975 [2025-03-16 19:56:14,694 INFO L226 Difference]: Without dead ends: 21791 [2025-03-16 19:56:14,734 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:56:14,735 INFO L435 NwaCegarLoop]: 4375 mSDtfsCounter, 4713 mSDsluCounter, 13119 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 17494 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:14,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 17494 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21791 states. [2025-03-16 19:56:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21791 to 20118. [2025-03-16 19:56:15,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 18112 states have (on average 1.6711572438162545) internal successors, (30268), 18780 states have internal predecessors, (30268), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-16 19:56:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 36260 transitions. [2025-03-16 19:56:15,779 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 36260 transitions. Word has length 101 [2025-03-16 19:56:15,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:15,779 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 36260 transitions. [2025-03-16 19:56:15,779 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 36260 transitions. [2025-03-16 19:56:15,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:15,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:15,792 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] [2025-03-16 19:56:15,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:56:15,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:15,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1629410620, now seen corresponding path program 1 times [2025-03-16 19:56:15,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:15,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031622622] [2025-03-16 19:56:15,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:15,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:15,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:15,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:15,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:15,875 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:56:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031622622] [2025-03-16 19:56:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031622622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:56:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892491915] [2025-03-16 19:56:15,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:56:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:15,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:56:15,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:56:15,878 INFO L87 Difference]: Start difference. First operand 20118 states and 36260 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:16,870 INFO L93 Difference]: Finished difference Result 43220 states and 80810 transitions. [2025-03-16 19:56:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:56:16,871 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:16,987 INFO L225 Difference]: With dead ends: 43220 [2025-03-16 19:56:16,987 INFO L226 Difference]: Without dead ends: 25235 [2025-03-16 19:56:17,034 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:56:17,036 INFO L435 NwaCegarLoop]: 4196 mSDtfsCounter, 4388 mSDsluCounter, 8296 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4402 SdHoareTripleChecker+Valid, 12492 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:17,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4402 Valid, 12492 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:56:17,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25235 states. [2025-03-16 19:56:18,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25235 to 20118. [2025-03-16 19:56:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 18112 states have (on average 1.6675684628975265) internal successors, (30203), 18780 states have internal predecessors, (30203), 948 states have call successors, (948), 390 states have call predecessors, (948), 1056 states have return successors, (5044), 1011 states have call predecessors, (5044), 948 states have call successors, (5044) [2025-03-16 19:56:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 36195 transitions. [2025-03-16 19:56:18,338 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 36195 transitions. Word has length 101 [2025-03-16 19:56:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:18,338 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 36195 transitions. [2025-03-16 19:56:18,339 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 36195 transitions. [2025-03-16 19:56:18,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:18,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:18,349 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] [2025-03-16 19:56:18,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:56:18,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2048927451, now seen corresponding path program 1 times [2025-03-16 19:56:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609356471] [2025-03-16 19:56:18,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:18,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:18,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:18,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:18,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:18,477 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:56:18,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:18,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609356471] [2025-03-16 19:56:18,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609356471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:18,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:18,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106937789] [2025-03-16 19:56:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:18,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:18,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:18,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:18,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:18,480 INFO L87 Difference]: Start difference. First operand 20118 states and 36195 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:20,140 INFO L93 Difference]: Finished difference Result 62442 states and 118688 transitions. [2025-03-16 19:56:20,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:56:20,141 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:20,354 INFO L225 Difference]: With dead ends: 62442 [2025-03-16 19:56:20,355 INFO L226 Difference]: Without dead ends: 44457 [2025-03-16 19:56:20,410 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:56:20,411 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4565 mSDsluCounter, 13096 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4578 SdHoareTripleChecker+Valid, 17463 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:20,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4578 Valid, 17463 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:56:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44457 states. [2025-03-16 19:56:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44457 to 42054. [2025-03-16 19:56:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42054 states, 37406 states have (on average 1.6700261990055072) internal successors, (62469), 39468 states have internal predecessors, (62469), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 19:56:23,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42054 states to 42054 states and 82477 transitions. [2025-03-16 19:56:23,074 INFO L78 Accepts]: Start accepts. Automaton has 42054 states and 82477 transitions. Word has length 101 [2025-03-16 19:56:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:23,075 INFO L471 AbstractCegarLoop]: Abstraction has 42054 states and 82477 transitions. [2025-03-16 19:56:23,075 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 42054 states and 82477 transitions. [2025-03-16 19:56:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:23,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:23,096 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] [2025-03-16 19:56:23,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:56:23,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:23,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash 2062460252, now seen corresponding path program 1 times [2025-03-16 19:56:23,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:23,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113787474] [2025-03-16 19:56:23,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:23,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:23,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:23,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:23,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:23,189 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:56:23,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113787474] [2025-03-16 19:56:23,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113787474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:23,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:23,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:56:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078526790] [2025-03-16 19:56:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:56:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:23,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:56:23,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:56:23,190 INFO L87 Difference]: Start difference. First operand 42054 states and 82477 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:25,434 INFO L93 Difference]: Finished difference Result 92920 states and 192942 transitions. [2025-03-16 19:56:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:56:25,435 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:25,718 INFO L225 Difference]: With dead ends: 92920 [2025-03-16 19:56:25,718 INFO L226 Difference]: Without dead ends: 52999 [2025-03-16 19:56:25,835 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:56:25,837 INFO L435 NwaCegarLoop]: 4191 mSDtfsCounter, 4384 mSDsluCounter, 8287 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4398 SdHoareTripleChecker+Valid, 12478 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:25,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4398 Valid, 12478 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:56:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52999 states. [2025-03-16 19:56:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52999 to 42054. [2025-03-16 19:56:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42054 states, 37406 states have (on average 1.666577554403037) internal successors, (62340), 39468 states have internal predecessors, (62340), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 19:56:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42054 states to 42054 states and 82348 transitions. [2025-03-16 19:56:28,635 INFO L78 Accepts]: Start accepts. Automaton has 42054 states and 82348 transitions. Word has length 101 [2025-03-16 19:56:28,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:28,636 INFO L471 AbstractCegarLoop]: Abstraction has 42054 states and 82348 transitions. [2025-03-16 19:56:28,636 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:28,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42054 states and 82348 transitions. [2025-03-16 19:56:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:28,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:28,653 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] [2025-03-16 19:56:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:56:28,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:28,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1123691845, now seen corresponding path program 1 times [2025-03-16 19:56:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444599580] [2025-03-16 19:56:28,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:28,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:28,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:28,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:28,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:28,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:28,729 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:56:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444599580] [2025-03-16 19:56:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444599580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:56:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650656627] [2025-03-16 19:56:28,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:56:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:28,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:56:28,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:56:28,731 INFO L87 Difference]: Start difference. First operand 42054 states and 82348 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:56:31,639 INFO L93 Difference]: Finished difference Result 90731 states and 188306 transitions. [2025-03-16 19:56:31,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:56:31,639 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2025-03-16 19:56:31,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:56:31,914 INFO L225 Difference]: With dead ends: 90731 [2025-03-16 19:56:31,914 INFO L226 Difference]: Without dead ends: 50810 [2025-03-16 19:56:32,018 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:56:32,018 INFO L435 NwaCegarLoop]: 4188 mSDtfsCounter, 4381 mSDsluCounter, 8282 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4395 SdHoareTripleChecker+Valid, 12470 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:56:32,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4395 Valid, 12470 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:56:32,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50810 states. [2025-03-16 19:56:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50810 to 42054. [2025-03-16 19:56:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42054 states, 37406 states have (on average 1.6631289098005668) internal successors, (62211), 39468 states have internal predecessors, (62211), 1812 states have call successors, (1812), 774 states have call predecessors, (1812), 2834 states have return successors, (18196), 1939 states have call predecessors, (18196), 1812 states have call successors, (18196) [2025-03-16 19:56:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42054 states to 42054 states and 82219 transitions. [2025-03-16 19:56:35,229 INFO L78 Accepts]: Start accepts. Automaton has 42054 states and 82219 transitions. Word has length 101 [2025-03-16 19:56:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:56:35,229 INFO L471 AbstractCegarLoop]: Abstraction has 42054 states and 82219 transitions. [2025-03-16 19:56:35,229 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:56:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 42054 states and 82219 transitions. [2025-03-16 19:56:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 19:56:35,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:56:35,243 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] [2025-03-16 19:56:35,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:56:35,243 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:56:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:56:35,244 INFO L85 PathProgramCache]: Analyzing trace with hash -256639620, now seen corresponding path program 1 times [2025-03-16 19:56:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:56:35,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193973462] [2025-03-16 19:56:35,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:56:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:56:35,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 19:56:35,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 19:56:35,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:56:35,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:56:35,489 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:56:35,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:56:35,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193973462] [2025-03-16 19:56:35,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193973462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:56:35,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:56:35,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:56:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634963232] [2025-03-16 19:56:35,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:56:35,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:56:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:56:35,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:56:35,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:56:35,490 INFO L87 Difference]: Start difference. First operand 42054 states and 82219 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, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)