./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4255e287381ef73889c6a5b585c01c307d069f6811a8716aac357c19b4c310de --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:04:26,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:04:26,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:04:26,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:04:26,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:04:26,144 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:04:26,145 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:04:26,145 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:04:26,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:04:26,146 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:04:26,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:04:26,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:04:26,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:04:26,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:04:26,146 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:04:26,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:04:26,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:04:26,146 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:04:26,147 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:04:26,148 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:26,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:04:26,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:04:26,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:04:26,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:04:26,149 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:04:26,149 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 -> 4255e287381ef73889c6a5b585c01c307d069f6811a8716aac357c19b4c310de [2025-03-16 20:04:26,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:04:26,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:04:26,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:04:26,504 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:04:26,504 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:04:26,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-1.c [2025-03-16 20:04:27,687 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47b57cb9/309994105d38485184f60828c1181054/FLAG1e3d97b86 [2025-03-16 20:04:28,221 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:04:28,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.11.cil-1.c [2025-03-16 20:04:28,266 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47b57cb9/309994105d38485184f60828c1181054/FLAG1e3d97b86 [2025-03-16 20:04:28,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47b57cb9/309994105d38485184f60828c1181054 [2025-03-16 20:04:28,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:04:28,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:04:28,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:28,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:04:28,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:04:28,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:28" (1/1) ... [2025-03-16 20:04:28,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56810f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:28, skipping insertion in model container [2025-03-16 20:04:28,776 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:04:28" (1/1) ... [2025-03-16 20:04:28,903 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:04:29,969 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_label46+token_ring.11.cil-1.c[382357,382370] [2025-03-16 20:04:29,994 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_label46+token_ring.11.cil-1.c[383339,383352] [2025-03-16 20:04:30,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:30,242 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:04:30,825 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_label46+token_ring.11.cil-1.c[382357,382370] [2025-03-16 20:04:30,836 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_label46+token_ring.11.cil-1.c[383339,383352] [2025-03-16 20:04:30,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:04:30,908 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:04:30,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30 WrapperNode [2025-03-16 20:04:30,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:04:30,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:30,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:04:30,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:04:30,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:30,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,319 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13134 [2025-03-16 20:04:31,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:04:31,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:04:31,321 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:04:31,321 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:04:31,330 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,520 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 20:04:31,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,812 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:04:31,818 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:04:31,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:04:31,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:04:31,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (1/1) ... [2025-03-16 20:04:31,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:04:31,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:04:31,868 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 20:04:31,877 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 20:04:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:04:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:04:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:04:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:04:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:04:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:04:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:04:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:04:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:04:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:04:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:04:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:04:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:04:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:04:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:04:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:04:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:04:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:04:32,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:04:32,029 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:04:38,419 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:04:38,420 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:04:38,420 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:04:38,421 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:04:38,421 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:04:38,421 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:04:38,424 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:04:38,694 INFO L? ?]: Removed 1739 outVars from TransFormulas that were not future-live. [2025-03-16 20:04:38,695 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:04:38,756 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:04:38,757 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:04:38,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:38 BoogieIcfgContainer [2025-03-16 20:04:38,757 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:04:38,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:04:38,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:04:38,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:04:38,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:04:28" (1/3) ... [2025-03-16 20:04:38,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca5a8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:38, skipping insertion in model container [2025-03-16 20:04:38,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:04:30" (2/3) ... [2025-03-16 20:04:38,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca5a8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:04:38, skipping insertion in model container [2025-03-16 20:04:38,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:04:38" (3/3) ... [2025-03-16 20:04:38,765 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.11.cil-1.c [2025-03-16 20:04:38,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:04:38,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.11.cil-1.c that has 8 procedures, 2469 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-03-16 20:04:38,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:04:38,890 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;@2979ce04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:04:38,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:04:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 2469 states, 2433 states have (on average 1.865187011919441) internal successors, (4538), 2437 states have internal predecessors, (4538), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-16 20:04:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:38,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:38,919 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:38,919 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:38,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:38,924 INFO L85 PathProgramCache]: Analyzing trace with hash 243631357, now seen corresponding path program 1 times [2025-03-16 20:04:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:38,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956432100] [2025-03-16 20:04:38,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:39,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:39,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:39,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:39,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:39,462 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 20:04:39,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:39,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956432100] [2025-03-16 20:04:39,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956432100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:39,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:39,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019852063] [2025-03-16 20:04:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:39,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:39,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:39,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:39,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:39,494 INFO L87 Difference]: Start difference. First operand has 2469 states, 2433 states have (on average 1.865187011919441) internal successors, (4538), 2437 states have internal predecessors, (4538), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:40,324 INFO L93 Difference]: Finished difference Result 5291 states and 9779 transitions. [2025-03-16 20:04:40,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:04:40,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:40,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:40,356 INFO L225 Difference]: With dead ends: 5291 [2025-03-16 20:04:40,356 INFO L226 Difference]: Without dead ends: 2831 [2025-03-16 20:04:40,367 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 20:04:40,371 INFO L435 NwaCegarLoop]: 4400 mSDtfsCounter, 5005 mSDsluCounter, 9043 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5024 SdHoareTripleChecker+Valid, 13443 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:40,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5024 Valid, 13443 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2831 states. [2025-03-16 20:04:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2831 to 2802. [2025-03-16 20:04:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2740 states have (on average 1.8116788321167883) internal successors, (4964), 2744 states have internal predecessors, (4964), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-16 20:04:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 5057 transitions. [2025-03-16 20:04:40,528 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 5057 transitions. Word has length 152 [2025-03-16 20:04:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:40,528 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 5057 transitions. [2025-03-16 20:04:40,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 5057 transitions. [2025-03-16 20:04:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:40,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:40,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:04:40,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:40,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:40,534 INFO L85 PathProgramCache]: Analyzing trace with hash 512114299, now seen corresponding path program 1 times [2025-03-16 20:04:40,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:40,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063251979] [2025-03-16 20:04:40,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:40,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:40,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:40,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:40,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:40,741 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 20:04:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063251979] [2025-03-16 20:04:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063251979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:40,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:40,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386583371] [2025-03-16 20:04:40,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:40,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:40,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:40,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:40,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:40,743 INFO L87 Difference]: Start difference. First operand 2802 states and 5057 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:41,068 INFO L93 Difference]: Finished difference Result 3538 states and 6267 transitions. [2025-03-16 20:04:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:41,080 INFO L225 Difference]: With dead ends: 3538 [2025-03-16 20:04:41,081 INFO L226 Difference]: Without dead ends: 2874 [2025-03-16 20:04:41,084 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 20:04:41,084 INFO L435 NwaCegarLoop]: 4382 mSDtfsCounter, 4697 mSDsluCounter, 8615 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4716 SdHoareTripleChecker+Valid, 12997 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:41,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4716 Valid, 12997 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2025-03-16 20:04:41,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2802. [2025-03-16 20:04:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2740 states have (on average 1.8109489051094891) internal successors, (4962), 2744 states have internal predecessors, (4962), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-03-16 20:04:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 5055 transitions. [2025-03-16 20:04:41,159 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 5055 transitions. Word has length 152 [2025-03-16 20:04:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:41,159 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 5055 transitions. [2025-03-16 20:04:41,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 5055 transitions. [2025-03-16 20:04:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:41,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:41,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:41,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:04:41,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:41,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash 239678012, now seen corresponding path program 1 times [2025-03-16 20:04:41,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689598179] [2025-03-16 20:04:41,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:41,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:41,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:41,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:41,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:41,400 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 20:04:41,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:41,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689598179] [2025-03-16 20:04:41,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689598179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:41,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:41,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:41,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202848363] [2025-03-16 20:04:41,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:41,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:41,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:41,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:41,404 INFO L87 Difference]: Start difference. First operand 2802 states and 5055 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:42,185 INFO L93 Difference]: Finished difference Result 3896 states and 6840 transitions. [2025-03-16 20:04:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:42,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:42,198 INFO L225 Difference]: With dead ends: 3896 [2025-03-16 20:04:42,199 INFO L226 Difference]: Without dead ends: 3232 [2025-03-16 20:04:42,201 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 20:04:42,202 INFO L435 NwaCegarLoop]: 4686 mSDtfsCounter, 4995 mSDsluCounter, 14103 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 18789 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:42,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 18789 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 20:04:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-03-16 20:04:42,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3115. [2025-03-16 20:04:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3115 states, 3026 states have (on average 1.7901520158625248) internal successors, (5417), 3031 states have internal predecessors, (5417), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-03-16 20:04:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 5553 transitions. [2025-03-16 20:04:42,295 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 5553 transitions. Word has length 152 [2025-03-16 20:04:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 3115 states and 5553 transitions. [2025-03-16 20:04:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:42,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 5553 transitions. [2025-03-16 20:04:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:42,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:42,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:42,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:04:42,298 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:42,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash -234347971, now seen corresponding path program 1 times [2025-03-16 20:04:42,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:42,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997481470] [2025-03-16 20:04:42,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:42,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:42,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:42,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:42,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:42,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:42,474 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 20:04:42,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:42,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997481470] [2025-03-16 20:04:42,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997481470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:42,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:42,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:42,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006012207] [2025-03-16 20:04:42,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:42,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:42,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:42,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:42,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:42,478 INFO L87 Difference]: Start difference. First operand 3115 states and 5553 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:43,213 INFO L93 Difference]: Finished difference Result 4893 states and 8449 transitions. [2025-03-16 20:04:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:43,230 INFO L225 Difference]: With dead ends: 4893 [2025-03-16 20:04:43,231 INFO L226 Difference]: Without dead ends: 3916 [2025-03-16 20:04:43,236 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 20:04:43,236 INFO L435 NwaCegarLoop]: 4682 mSDtfsCounter, 4990 mSDsluCounter, 14091 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5009 SdHoareTripleChecker+Valid, 18773 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:43,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5009 Valid, 18773 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3916 states. [2025-03-16 20:04:43,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3916 to 3782. [2025-03-16 20:04:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3637 states have (on average 1.76024195765741) internal successors, (6402), 3646 states have internal predecessors, (6402), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-03-16 20:04:43,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 6630 transitions. [2025-03-16 20:04:43,372 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 6630 transitions. Word has length 152 [2025-03-16 20:04:43,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:43,372 INFO L471 AbstractCegarLoop]: Abstraction has 3782 states and 6630 transitions. [2025-03-16 20:04:43,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 6630 transitions. [2025-03-16 20:04:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:43,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:43,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:43,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:04:43,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:43,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:43,380 INFO L85 PathProgramCache]: Analyzing trace with hash -526733796, now seen corresponding path program 1 times [2025-03-16 20:04:43,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:43,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056920489] [2025-03-16 20:04:43,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:43,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:43,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:43,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:43,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:43,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:43,564 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 20:04:43,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:43,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056920489] [2025-03-16 20:04:43,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056920489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:43,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:43,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505824967] [2025-03-16 20:04:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:43,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:43,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:43,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:43,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:43,566 INFO L87 Difference]: Start difference. First operand 3782 states and 6630 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:44,348 INFO L93 Difference]: Finished difference Result 7046 states and 11988 transitions. [2025-03-16 20:04:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:44,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:44,373 INFO L225 Difference]: With dead ends: 7046 [2025-03-16 20:04:44,373 INFO L226 Difference]: Without dead ends: 5402 [2025-03-16 20:04:44,381 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 20:04:44,382 INFO L435 NwaCegarLoop]: 4679 mSDtfsCounter, 4985 mSDsluCounter, 14082 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5004 SdHoareTripleChecker+Valid, 18761 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:44,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5004 Valid, 18761 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:44,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5402 states. [2025-03-16 20:04:44,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5402 to 5233. [2025-03-16 20:04:44,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 4970 states have (on average 1.7275653923541248) internal successors, (8586), 4993 states have internal predecessors, (8586), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-03-16 20:04:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 9022 transitions. [2025-03-16 20:04:44,550 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 9022 transitions. Word has length 152 [2025-03-16 20:04:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:44,551 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 9022 transitions. [2025-03-16 20:04:44,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 9022 transitions. [2025-03-16 20:04:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:44,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:44,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:44,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:04:44,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:44,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:44,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1403497053, now seen corresponding path program 1 times [2025-03-16 20:04:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976170891] [2025-03-16 20:04:44,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:44,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:44,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:44,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:44,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:44,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:44,701 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 20:04:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976170891] [2025-03-16 20:04:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976170891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:44,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724236939] [2025-03-16 20:04:44,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:44,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:44,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:44,705 INFO L87 Difference]: Start difference. First operand 5233 states and 9022 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:45,456 INFO L93 Difference]: Finished difference Result 11801 states and 20006 transitions. [2025-03-16 20:04:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:45,503 INFO L225 Difference]: With dead ends: 11801 [2025-03-16 20:04:45,503 INFO L226 Difference]: Without dead ends: 8706 [2025-03-16 20:04:45,516 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 20:04:45,517 INFO L435 NwaCegarLoop]: 4676 mSDtfsCounter, 4980 mSDsluCounter, 14073 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4999 SdHoareTripleChecker+Valid, 18749 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:45,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4999 Valid, 18749 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states. [2025-03-16 20:04:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8468. [2025-03-16 20:04:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 7951 states have (on average 1.7056973965538926) internal successors, (13562), 8020 states have internal predecessors, (13562), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-16 20:04:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 14510 transitions. [2025-03-16 20:04:45,753 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 14510 transitions. Word has length 152 [2025-03-16 20:04:45,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:45,755 INFO L471 AbstractCegarLoop]: Abstraction has 8468 states and 14510 transitions. [2025-03-16 20:04:45,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:45,756 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 14510 transitions. [2025-03-16 20:04:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:45,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:45,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:45,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:04:45,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:45,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:45,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1188667900, now seen corresponding path program 1 times [2025-03-16 20:04:45,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402610235] [2025-03-16 20:04:45,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:45,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:45,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:45,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:45,882 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 20:04:45,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:45,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402610235] [2025-03-16 20:04:45,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402610235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:45,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:45,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:45,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074256805] [2025-03-16 20:04:45,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:45,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:45,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:45,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:45,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:45,884 INFO L87 Difference]: Start difference. First operand 8468 states and 14510 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:46,339 INFO L93 Difference]: Finished difference Result 16292 states and 28062 transitions. [2025-03-16 20:04:46,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:46,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:46,389 INFO L225 Difference]: With dead ends: 16292 [2025-03-16 20:04:46,389 INFO L226 Difference]: Without dead ends: 9962 [2025-03-16 20:04:46,412 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 20:04:46,413 INFO L435 NwaCegarLoop]: 4369 mSDtfsCounter, 4689 mSDsluCounter, 8590 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4708 SdHoareTripleChecker+Valid, 12959 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:46,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4708 Valid, 12959 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9962 states. [2025-03-16 20:04:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9962 to 8468. [2025-03-16 20:04:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 7951 states have (on average 1.703559300716891) internal successors, (13545), 8020 states have internal predecessors, (13545), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-16 20:04:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 14493 transitions. [2025-03-16 20:04:46,715 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 14493 transitions. Word has length 152 [2025-03-16 20:04:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:46,715 INFO L471 AbstractCegarLoop]: Abstraction has 8468 states and 14493 transitions. [2025-03-16 20:04:46,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 14493 transitions. [2025-03-16 20:04:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:46,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:46,720 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:46,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:04:46,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:46,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:46,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1312114051, now seen corresponding path program 1 times [2025-03-16 20:04:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:46,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682897406] [2025-03-16 20:04:46,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:46,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:46,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:46,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:46,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:46,824 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 20:04:46,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:46,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682897406] [2025-03-16 20:04:46,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682897406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:46,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:46,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985402946] [2025-03-16 20:04:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:46,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:46,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:46,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:46,826 INFO L87 Difference]: Start difference. First operand 8468 states and 14493 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:47,221 INFO L93 Difference]: Finished difference Result 16209 states and 27862 transitions. [2025-03-16 20:04:47,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:47,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:47,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:47,253 INFO L225 Difference]: With dead ends: 16209 [2025-03-16 20:04:47,253 INFO L226 Difference]: Without dead ends: 9879 [2025-03-16 20:04:47,270 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 20:04:47,271 INFO L435 NwaCegarLoop]: 4366 mSDtfsCounter, 4686 mSDsluCounter, 8585 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4705 SdHoareTripleChecker+Valid, 12951 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:47,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4705 Valid, 12951 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:04:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9879 states. [2025-03-16 20:04:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9879 to 8468. [2025-03-16 20:04:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8468 states, 7951 states have (on average 1.7014212048798893) internal successors, (13528), 8020 states have internal predecessors, (13528), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-03-16 20:04:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8468 states to 8468 states and 14476 transitions. [2025-03-16 20:04:47,623 INFO L78 Accepts]: Start accepts. Automaton has 8468 states and 14476 transitions. Word has length 152 [2025-03-16 20:04:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:47,623 INFO L471 AbstractCegarLoop]: Abstraction has 8468 states and 14476 transitions. [2025-03-16 20:04:47,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8468 states and 14476 transitions. [2025-03-16 20:04:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:47,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:47,627 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:47,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:04:47,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:47,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash -838595108, now seen corresponding path program 1 times [2025-03-16 20:04:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481804010] [2025-03-16 20:04:47,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:47,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:47,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:47,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:47,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:47,748 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 20:04:47,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:47,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481804010] [2025-03-16 20:04:47,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481804010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:47,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:47,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745094337] [2025-03-16 20:04:47,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:47,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:47,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:47,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:47,751 INFO L87 Difference]: Start difference. First operand 8468 states and 14476 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:48,549 INFO L93 Difference]: Finished difference Result 22384 states and 38338 transitions. [2025-03-16 20:04:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:48,605 INFO L225 Difference]: With dead ends: 22384 [2025-03-16 20:04:48,605 INFO L226 Difference]: Without dead ends: 16054 [2025-03-16 20:04:48,627 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 20:04:48,628 INFO L435 NwaCegarLoop]: 4663 mSDtfsCounter, 4959 mSDsluCounter, 14036 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4978 SdHoareTripleChecker+Valid, 18699 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:48,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4978 Valid, 18699 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:04:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16054 states. [2025-03-16 20:04:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16054 to 15721. [2025-03-16 20:04:49,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15721 states, 14642 states have (on average 1.6967627373309657) internal successors, (24844), 14857 states have internal predecessors, (24844), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-16 20:04:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15721 states to 15721 states and 27200 transitions. [2025-03-16 20:04:49,243 INFO L78 Accepts]: Start accepts. Automaton has 15721 states and 27200 transitions. Word has length 152 [2025-03-16 20:04:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:49,243 INFO L471 AbstractCegarLoop]: Abstraction has 15721 states and 27200 transitions. [2025-03-16 20:04:49,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand 15721 states and 27200 transitions. [2025-03-16 20:04:49,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:49,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:49,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:49,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:04:49,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash -407678307, now seen corresponding path program 1 times [2025-03-16 20:04:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319142713] [2025-03-16 20:04:49,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:49,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:49,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:49,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:49,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:49,369 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 20:04:49,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:49,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319142713] [2025-03-16 20:04:49,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319142713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:49,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:49,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:49,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615761074] [2025-03-16 20:04:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:49,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:49,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:49,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:49,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:49,371 INFO L87 Difference]: Start difference. First operand 15721 states and 27200 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:50,088 INFO L93 Difference]: Finished difference Result 32734 states and 57628 transitions. [2025-03-16 20:04:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:50,148 INFO L225 Difference]: With dead ends: 32734 [2025-03-16 20:04:50,148 INFO L226 Difference]: Without dead ends: 19151 [2025-03-16 20:04:50,181 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 20:04:50,182 INFO L435 NwaCegarLoop]: 4359 mSDtfsCounter, 4681 mSDsluCounter, 8572 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4700 SdHoareTripleChecker+Valid, 12931 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:50,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4700 Valid, 12931 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19151 states. [2025-03-16 20:04:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19151 to 15721. [2025-03-16 20:04:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15721 states, 14642 states have (on average 1.6945089468651824) internal successors, (24811), 14857 states have internal predecessors, (24811), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-03-16 20:04:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15721 states to 15721 states and 27167 transitions. [2025-03-16 20:04:50,737 INFO L78 Accepts]: Start accepts. Automaton has 15721 states and 27167 transitions. Word has length 152 [2025-03-16 20:04:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:50,739 INFO L471 AbstractCegarLoop]: Abstraction has 15721 states and 27167 transitions. [2025-03-16 20:04:50,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 15721 states and 27167 transitions. [2025-03-16 20:04:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:50,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:50,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:50,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:04:50,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:50,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:50,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1983828894, now seen corresponding path program 1 times [2025-03-16 20:04:50,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:50,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282426084] [2025-03-16 20:04:50,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:50,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:50,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:50,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:50,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:50,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:50,879 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 20:04:50,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282426084] [2025-03-16 20:04:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282426084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652793393] [2025-03-16 20:04:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:50,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:50,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:50,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:50,880 INFO L87 Difference]: Start difference. First operand 15721 states and 27167 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:52,128 INFO L93 Difference]: Finished difference Result 48397 states and 85122 transitions. [2025-03-16 20:04:52,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:52,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:52,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:52,262 INFO L225 Difference]: With dead ends: 48397 [2025-03-16 20:04:52,262 INFO L226 Difference]: Without dead ends: 34814 [2025-03-16 20:04:52,302 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 20:04:52,303 INFO L435 NwaCegarLoop]: 4649 mSDtfsCounter, 5251 mSDsluCounter, 13992 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5282 SdHoareTripleChecker+Valid, 18641 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:52,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5282 Valid, 18641 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:04:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34814 states. [2025-03-16 20:04:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34814 to 31994. [2025-03-16 20:04:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31994 states, 29661 states have (on average 1.7049661171234956) internal successors, (50571), 30330 states have internal predecessors, (50571), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-16 20:04:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31994 states to 31994 states and 57215 transitions. [2025-03-16 20:04:53,355 INFO L78 Accepts]: Start accepts. Automaton has 31994 states and 57215 transitions. Word has length 152 [2025-03-16 20:04:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:53,356 INFO L471 AbstractCegarLoop]: Abstraction has 31994 states and 57215 transitions. [2025-03-16 20:04:53,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 31994 states and 57215 transitions. [2025-03-16 20:04:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:53,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:53,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:04:53,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:04:53,369 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:53,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:53,370 INFO L85 PathProgramCache]: Analyzing trace with hash -709972355, now seen corresponding path program 1 times [2025-03-16 20:04:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:53,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510524317] [2025-03-16 20:04:53,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:53,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:53,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:53,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:53,452 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 20:04:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:53,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510524317] [2025-03-16 20:04:53,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510524317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:53,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:53,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:04:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152688768] [2025-03-16 20:04:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:53,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:04:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:53,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:04:53,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:04:53,454 INFO L87 Difference]: Start difference. First operand 31994 states and 57215 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:55,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:55,237 INFO L93 Difference]: Finished difference Result 70622 states and 130020 transitions. [2025-03-16 20:04:55,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:04:55,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:55,585 INFO L225 Difference]: With dead ends: 70622 [2025-03-16 20:04:55,585 INFO L226 Difference]: Without dead ends: 40766 [2025-03-16 20:04:55,630 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 20:04:55,631 INFO L435 NwaCegarLoop]: 4354 mSDtfsCounter, 4675 mSDsluCounter, 8561 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4694 SdHoareTripleChecker+Valid, 12915 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:04:55,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4694 Valid, 12915 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:04:55,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40766 states. [2025-03-16 20:04:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40766 to 31994. [2025-03-16 20:04:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31994 states, 29661 states have (on average 1.7027746872998213) internal successors, (50506), 30330 states have internal predecessors, (50506), 1275 states have call successors, (1275), 391 states have call predecessors, (1275), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-03-16 20:04:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31994 states to 31994 states and 57150 transitions. [2025-03-16 20:04:56,800 INFO L78 Accepts]: Start accepts. Automaton has 31994 states and 57150 transitions. Word has length 152 [2025-03-16 20:04:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:04:56,801 INFO L471 AbstractCegarLoop]: Abstraction has 31994 states and 57150 transitions. [2025-03-16 20:04:56,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 31994 states and 57150 transitions. [2025-03-16 20:04:56,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:04:56,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:04:56,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:04:56,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:04:56,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:04:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:04:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1351058498, now seen corresponding path program 1 times [2025-03-16 20:04:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:04:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186209988] [2025-03-16 20:04:56,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:04:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:04:56,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:04:56,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:04:56,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:04:56,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:04:56,913 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 20:04:56,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:04:56,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186209988] [2025-03-16 20:04:56,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186209988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:04:56,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:04:56,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:04:56,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998102005] [2025-03-16 20:04:56,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:04:56,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:04:56,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:04:56,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:04:56,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:04:56,915 INFO L87 Difference]: Start difference. First operand 31994 states and 57150 transitions. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:04:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:04:59,685 INFO L93 Difference]: Finished difference Result 103830 states and 192473 transitions. [2025-03-16 20:04:59,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:04:59,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:04:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:04:59,962 INFO L225 Difference]: With dead ends: 103830 [2025-03-16 20:04:59,962 INFO L226 Difference]: Without dead ends: 73974 [2025-03-16 20:05:00,054 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 20:05:00,055 INFO L435 NwaCegarLoop]: 4641 mSDtfsCounter, 5184 mSDsluCounter, 13969 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5215 SdHoareTripleChecker+Valid, 18610 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:00,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5215 Valid, 18610 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:05:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73974 states. [2025-03-16 20:05:03,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73974 to 69304. [2025-03-16 20:05:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69304 states, 64009 states have (on average 1.7205080535549688) internal successors, (110128), 66072 states have internal predecessors, (110128), 2459 states have call successors, (2459), 775 states have call predecessors, (2459), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-16 20:05:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69304 states to 69304 states and 131428 transitions. [2025-03-16 20:05:03,719 INFO L78 Accepts]: Start accepts. Automaton has 69304 states and 131428 transitions. Word has length 152 [2025-03-16 20:05:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:03,719 INFO L471 AbstractCegarLoop]: Abstraction has 69304 states and 131428 transitions. [2025-03-16 20:05:03,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 69304 states and 131428 transitions. [2025-03-16 20:05:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:05:03,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:03,738 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:05:03,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:05:03,738 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:03,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:03,739 INFO L85 PathProgramCache]: Analyzing trace with hash -124812707, now seen corresponding path program 1 times [2025-03-16 20:05:03,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795771256] [2025-03-16 20:05:03,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:03,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:03,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:05:03,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:05:03,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:03,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:03,820 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 20:05:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:03,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795771256] [2025-03-16 20:05:03,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795771256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:03,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:03,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:05:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093975639] [2025-03-16 20:05:03,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:03,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:05:03,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:03,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:05:03,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:05:03,824 INFO L87 Difference]: Start difference. First operand 69304 states and 131428 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:05:07,371 INFO L93 Difference]: Finished difference Result 158360 states and 312724 transitions. [2025-03-16 20:05:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:05:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 152 [2025-03-16 20:05:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:05:07,776 INFO L225 Difference]: With dead ends: 158360 [2025-03-16 20:05:07,777 INFO L226 Difference]: Without dead ends: 91194 [2025-03-16 20:05:07,956 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 20:05:07,957 INFO L435 NwaCegarLoop]: 4349 mSDtfsCounter, 4671 mSDsluCounter, 8552 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4690 SdHoareTripleChecker+Valid, 12901 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:05:07,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4690 Valid, 12901 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:05:08,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91194 states. [2025-03-16 20:05:11,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91194 to 69304. [2025-03-16 20:05:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69304 states, 64009 states have (on average 1.7184927119623803) internal successors, (109999), 66072 states have internal predecessors, (109999), 2459 states have call successors, (2459), 775 states have call predecessors, (2459), 2834 states have return successors, (18841), 2584 states have call predecessors, (18841), 2457 states have call successors, (18841) [2025-03-16 20:05:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69304 states to 69304 states and 131299 transitions. [2025-03-16 20:05:11,522 INFO L78 Accepts]: Start accepts. Automaton has 69304 states and 131299 transitions. Word has length 152 [2025-03-16 20:05:11,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:05:11,522 INFO L471 AbstractCegarLoop]: Abstraction has 69304 states and 131299 transitions. [2025-03-16 20:05:11,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:05:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 69304 states and 131299 transitions. [2025-03-16 20:05:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-16 20:05:11,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:05:11,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:05:11,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:05:11,544 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:05:11,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:05:11,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1161669598, now seen corresponding path program 1 times [2025-03-16 20:05:11,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:05:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296293315] [2025-03-16 20:05:11,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:05:11,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:05:11,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-16 20:05:11,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-16 20:05:11,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:05:11,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:05:11,646 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 20:05:11,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:05:11,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296293315] [2025-03-16 20:05:11,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296293315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:05:11,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:05:11,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:05:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122846800] [2025-03-16 20:05:11,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:05:11,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:05:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:05:11,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:05:11,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:05:11,648 INFO L87 Difference]: Start difference. First operand 69304 states and 131299 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)