./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a20e3da1af1b90ef693cd4a0f1486b26f94de8addad62c4c950e54cba535f50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:05:26,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:05:26,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:05:26,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:05:26,671 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:05:26,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:05:26,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:05:26,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:05:26,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:05:26,702 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:05:26,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:05:26,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:05:26,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:05:26,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:05:26,703 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:05:26,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:05:26,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:05:26,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:05:26,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:05:26,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:05:26,706 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a20e3da1af1b90ef693cd4a0f1486b26f94de8addad62c4c950e54cba535f50 [2025-02-05 17:05:26,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:05:26,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:05:26,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:05:26,996 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:05:26,996 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:05:26,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c [2025-02-05 17:05:28,302 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb47bd6b/3117f2d2fa0d48f69573e99128d16918/FLAG983775201 [2025-02-05 17:05:29,110 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:05:29,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c [2025-02-05 17:05:29,168 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb47bd6b/3117f2d2fa0d48f69573e99128d16918/FLAG983775201 [2025-02-05 17:05:29,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bbb47bd6b/3117f2d2fa0d48f69573e99128d16918 [2025-02-05 17:05:29,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:05:29,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:05:29,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:05:29,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:05:29,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:05:29,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:05:29" (1/1) ... [2025-02-05 17:05:29,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407bab0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:29, skipping insertion in model container [2025-02-05 17:05:29,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:05:29" (1/1) ... [2025-02-05 17:05:29,556 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:05:30,963 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c[377069,377082] [2025-02-05 17:05:30,999 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c[383339,383352] [2025-02-05 17:05:31,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:05:31,302 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:05:31,928 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c[377069,377082] [2025-02-05 17:05:31,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.09.cil-1.c[383339,383352] [2025-02-05 17:05:31,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:05:32,027 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:05:32,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32 WrapperNode [2025-02-05 17:05:32,030 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:05:32,031 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:05:32,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:05:32,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:05:32,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,520 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13014 [2025-02-05 17:05:32,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:05:32,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:05:32,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:05:32,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:05:32,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,664 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-02-05 17:05:32,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,900 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:05:32,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:05:32,962 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:05:32,962 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:05:32,963 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (1/1) ... [2025-02-05 17:05:32,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:05:32,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:05:32,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:05:33,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:05:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:05:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:05:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:05:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:05:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:05:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:05:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:05:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:05:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:05:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:05:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:05:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:05:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:05:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:05:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:05:33,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:05:33,213 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:05:33,215 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:05:41,173 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:05:41,174 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:05:41,174 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:05:41,175 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:05:41,176 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:05:41,176 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:05:41,176 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:05:41,571 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2025-02-05 17:05:41,572 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:05:41,671 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:05:41,676 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:05:41,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:05:41 BoogieIcfgContainer [2025-02-05 17:05:41,676 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:05:41,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:05:41,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:05:41,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:05:41,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:05:29" (1/3) ... [2025-02-05 17:05:41,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472b74c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:05:41, skipping insertion in model container [2025-02-05 17:05:41,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:05:32" (2/3) ... [2025-02-05 17:05:41,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472b74c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:05:41, skipping insertion in model container [2025-02-05 17:05:41,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:05:41" (3/3) ... [2025-02-05 17:05:41,697 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.09.cil-1.c [2025-02-05 17:05:41,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:05:41,713 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label40+token_ring.09.cil-1.c that has 7 procedures, 2510 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-02-05 17:05:41,880 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:05:41,905 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;@2cb5e7e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:05:41,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:05:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 2510 states, 2478 states have (on average 1.8349475383373688) internal successors, (4547), 2481 states have internal predecessors, (4547), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-05 17:05:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:41,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:41,972 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] [2025-02-05 17:05:41,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:41,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:41,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1505179624, now seen corresponding path program 1 times [2025-02-05 17:05:41,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:41,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784585703] [2025-02-05 17:05:41,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:41,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:42,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:42,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:42,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:42,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784585703] [2025-02-05 17:05:42,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784585703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:42,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:42,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:05:42,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990080754] [2025-02-05 17:05:42,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:42,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:05:42,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:42,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:05:42,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:05:42,730 INFO L87 Difference]: Start difference. First operand has 2510 states, 2478 states have (on average 1.8349475383373688) internal successors, (4547), 2481 states have internal predecessors, (4547), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:43,642 INFO L93 Difference]: Finished difference Result 5347 states and 9709 transitions. [2025-02-05 17:05:43,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:05:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:43,675 INFO L225 Difference]: With dead ends: 5347 [2025-02-05 17:05:43,676 INFO L226 Difference]: Without dead ends: 2784 [2025-02-05 17:05:43,690 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-02-05 17:05:43,693 INFO L435 NwaCegarLoop]: 4414 mSDtfsCounter, 4941 mSDsluCounter, 9049 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4958 SdHoareTripleChecker+Valid, 13463 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:43,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4958 Valid, 13463 Invalid, 559 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:05:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2784 states. [2025-02-05 17:05:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2784 to 2761. [2025-02-05 17:05:43,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2705 states have (on average 1.7955637707948244) internal successors, (4857), 2708 states have internal predecessors, (4857), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:05:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4940 transitions. [2025-02-05 17:05:43,874 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4940 transitions. Word has length 145 [2025-02-05 17:05:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:43,875 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4940 transitions. [2025-02-05 17:05:43,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4940 transitions. [2025-02-05 17:05:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:43,884 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:43,884 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] [2025-02-05 17:05:43,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:05:43,885 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:43,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:43,885 INFO L85 PathProgramCache]: Analyzing trace with hash -633677862, now seen corresponding path program 1 times [2025-02-05 17:05:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:43,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473926333] [2025-02-05 17:05:43,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:43,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:43,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:43,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:43,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473926333] [2025-02-05 17:05:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473926333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:44,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:44,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:05:44,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467433178] [2025-02-05 17:05:44,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:05:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:44,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:05:44,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:05:44,179 INFO L87 Difference]: Start difference. First operand 2761 states and 4940 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:44,623 INFO L93 Difference]: Finished difference Result 3444 states and 6011 transitions. [2025-02-05 17:05:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:05:44,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:44,639 INFO L225 Difference]: With dead ends: 3444 [2025-02-05 17:05:44,640 INFO L226 Difference]: Without dead ends: 2821 [2025-02-05 17:05:44,644 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-02-05 17:05:44,645 INFO L435 NwaCegarLoop]: 4333 mSDtfsCounter, 4614 mSDsluCounter, 8541 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4631 SdHoareTripleChecker+Valid, 12874 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:44,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4631 Valid, 12874 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:05:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2025-02-05 17:05:44,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 2761. [2025-02-05 17:05:44,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2705 states have (on average 1.7948243992606285) internal successors, (4855), 2708 states have internal predecessors, (4855), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-02-05 17:05:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4938 transitions. [2025-02-05 17:05:44,814 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4938 transitions. Word has length 145 [2025-02-05 17:05:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:44,814 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4938 transitions. [2025-02-05 17:05:44,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4938 transitions. [2025-02-05 17:05:44,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:44,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:44,820 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] [2025-02-05 17:05:44,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:05:44,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:44,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:44,821 INFO L85 PathProgramCache]: Analyzing trace with hash -160158919, now seen corresponding path program 1 times [2025-02-05 17:05:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:44,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918809035] [2025-02-05 17:05:44,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:44,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:44,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:44,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:44,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:44,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:45,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:45,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:45,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918809035] [2025-02-05 17:05:45,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918809035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:45,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290181473] [2025-02-05 17:05:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:45,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:45,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:45,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:45,085 INFO L87 Difference]: Start difference. First operand 2761 states and 4938 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:45,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:45,925 INFO L93 Difference]: Finished difference Result 3779 states and 6523 transitions. [2025-02-05 17:05:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:05:45,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:45,946 INFO L225 Difference]: With dead ends: 3779 [2025-02-05 17:05:45,947 INFO L226 Difference]: Without dead ends: 3156 [2025-02-05 17:05:45,951 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-02-05 17:05:45,954 INFO L435 NwaCegarLoop]: 4607 mSDtfsCounter, 4870 mSDsluCounter, 13871 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4887 SdHoareTripleChecker+Valid, 18478 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:45,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4887 Valid, 18478 Invalid, 913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:05:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2025-02-05 17:05:46,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 3057. [2025-02-05 17:05:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 2976 states have (on average 1.768481182795699) internal successors, (5263), 2980 states have internal predecessors, (5263), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-02-05 17:05:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 5385 transitions. [2025-02-05 17:05:46,068 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 5385 transitions. Word has length 145 [2025-02-05 17:05:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:46,070 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 5385 transitions. [2025-02-05 17:05:46,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 5385 transitions. [2025-02-05 17:05:46,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:46,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:46,074 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] [2025-02-05 17:05:46,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:05:46,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 270757882, now seen corresponding path program 1 times [2025-02-05 17:05:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137924821] [2025-02-05 17:05:46,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:46,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:46,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:46,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:46,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:46,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137924821] [2025-02-05 17:05:46,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137924821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:46,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:46,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:46,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199803483] [2025-02-05 17:05:46,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:46,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:46,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:46,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:46,294 INFO L87 Difference]: Start difference. First operand 3057 states and 5385 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:47,227 INFO L93 Difference]: Finished difference Result 4708 states and 7945 transitions. [2025-02-05 17:05:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:05:47,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:47,251 INFO L225 Difference]: With dead ends: 4708 [2025-02-05 17:05:47,251 INFO L226 Difference]: Without dead ends: 3789 [2025-02-05 17:05:47,257 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-02-05 17:05:47,258 INFO L435 NwaCegarLoop]: 4599 mSDtfsCounter, 4862 mSDsluCounter, 13849 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4879 SdHoareTripleChecker+Valid, 18448 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:47,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4879 Valid, 18448 Invalid, 913 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:05:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2025-02-05 17:05:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3681. [2025-02-05 17:05:47,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3681 states, 3548 states have (on average 1.7294250281848929) internal successors, (6136), 3556 states have internal predecessors, (6136), 95 states have call successors, (95), 30 states have call predecessors, (95), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-02-05 17:05:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3681 states to 3681 states and 6342 transitions. [2025-02-05 17:05:47,423 INFO L78 Accepts]: Start accepts. Automaton has 3681 states and 6342 transitions. Word has length 145 [2025-02-05 17:05:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:47,423 INFO L471 AbstractCegarLoop]: Abstraction has 3681 states and 6342 transitions. [2025-02-05 17:05:47,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3681 states and 6342 transitions. [2025-02-05 17:05:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:47,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:47,427 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] [2025-02-05 17:05:47,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:05:47,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:47,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1632702213, now seen corresponding path program 1 times [2025-02-05 17:05:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367813386] [2025-02-05 17:05:47,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:47,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:47,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:47,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367813386] [2025-02-05 17:05:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367813386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:47,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:47,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:47,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94892378] [2025-02-05 17:05:47,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:47,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:47,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:47,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:47,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:47,644 INFO L87 Difference]: Start difference. First operand 3681 states and 6342 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:48,455 INFO L93 Difference]: Finished difference Result 6700 states and 11060 transitions. [2025-02-05 17:05:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:05:48,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:48,484 INFO L225 Difference]: With dead ends: 6700 [2025-02-05 17:05:48,485 INFO L226 Difference]: Without dead ends: 5157 [2025-02-05 17:05:48,492 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-02-05 17:05:48,494 INFO L435 NwaCegarLoop]: 4596 mSDtfsCounter, 4857 mSDsluCounter, 13840 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4874 SdHoareTripleChecker+Valid, 18436 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:48,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4874 Valid, 18436 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:05:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5157 states. [2025-02-05 17:05:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5157 to 5022. [2025-02-05 17:05:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5022 states, 4779 states have (on average 1.6840343168026783) internal successors, (8048), 4801 states have internal predecessors, (8048), 167 states have call successors, (167), 54 states have call predecessors, (167), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-02-05 17:05:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5022 states to 5022 states and 8446 transitions. [2025-02-05 17:05:48,700 INFO L78 Accepts]: Start accepts. Automaton has 5022 states and 8446 transitions. Word has length 145 [2025-02-05 17:05:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:48,700 INFO L471 AbstractCegarLoop]: Abstraction has 5022 states and 8446 transitions. [2025-02-05 17:05:48,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 5022 states and 8446 transitions. [2025-02-05 17:05:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:48,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:48,704 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] [2025-02-05 17:05:48,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:05:48,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:48,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -31536166, now seen corresponding path program 1 times [2025-02-05 17:05:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:48,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164271296] [2025-02-05 17:05:48,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:48,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:48,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:48,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:48,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:48,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:48,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:48,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164271296] [2025-02-05 17:05:48,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164271296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:48,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029578890] [2025-02-05 17:05:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:48,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:48,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:48,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:48,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:48,903 INFO L87 Difference]: Start difference. First operand 5022 states and 8446 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:49,767 INFO L93 Difference]: Finished difference Result 11037 states and 18038 transitions. [2025-02-05 17:05:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:05:49,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:49,814 INFO L225 Difference]: With dead ends: 11037 [2025-02-05 17:05:49,815 INFO L226 Difference]: Without dead ends: 8153 [2025-02-05 17:05:49,828 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-02-05 17:05:49,829 INFO L435 NwaCegarLoop]: 4593 mSDtfsCounter, 4852 mSDsluCounter, 13831 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4869 SdHoareTripleChecker+Valid, 18424 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:49,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4869 Valid, 18424 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:05:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8153 states. [2025-02-05 17:05:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8153 to 7965. [2025-02-05 17:05:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.6483164083377873) internal successors, (12336), 7552 states have internal predecessors, (12336), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:05:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13214 transitions. [2025-02-05 17:05:50,155 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13214 transitions. Word has length 145 [2025-02-05 17:05:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:50,157 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13214 transitions. [2025-02-05 17:05:50,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13214 transitions. [2025-02-05 17:05:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:50,162 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:50,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] [2025-02-05 17:05:50,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:05:50,163 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:50,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash -672622309, now seen corresponding path program 1 times [2025-02-05 17:05:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:50,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586463712] [2025-02-05 17:05:50,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:50,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:50,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:50,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:50,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:50,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:50,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586463712] [2025-02-05 17:05:50,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586463712] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:50,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:50,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:05:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564443020] [2025-02-05 17:05:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:50,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:05:50,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:50,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:05:50,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:05:50,311 INFO L87 Difference]: Start difference. First operand 7965 states and 13214 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:50,868 INFO L93 Difference]: Finished difference Result 14954 states and 24808 transitions. [2025-02-05 17:05:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:05:50,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:50,927 INFO L225 Difference]: With dead ends: 14954 [2025-02-05 17:05:50,928 INFO L226 Difference]: Without dead ends: 9127 [2025-02-05 17:05:50,950 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-02-05 17:05:50,952 INFO L435 NwaCegarLoop]: 4320 mSDtfsCounter, 4606 mSDsluCounter, 8516 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4623 SdHoareTripleChecker+Valid, 12836 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:50,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4623 Valid, 12836 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:05:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9127 states. [2025-02-05 17:05:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9127 to 7965. [2025-02-05 17:05:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.646044895777659) internal successors, (12319), 7552 states have internal predecessors, (12319), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:05:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13197 transitions. [2025-02-05 17:05:51,289 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13197 transitions. Word has length 145 [2025-02-05 17:05:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:51,290 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13197 transitions. [2025-02-05 17:05:51,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13197 transitions. [2025-02-05 17:05:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:51,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:51,295 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] [2025-02-05 17:05:51,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:05:51,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:51,296 INFO L85 PathProgramCache]: Analyzing trace with hash 553623482, now seen corresponding path program 1 times [2025-02-05 17:05:51,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:51,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185596953] [2025-02-05 17:05:51,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:51,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:51,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:51,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:51,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185596953] [2025-02-05 17:05:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185596953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:51,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:51,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:05:51,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269869140] [2025-02-05 17:05:51,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:51,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:05:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:51,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:05:51,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:05:51,463 INFO L87 Difference]: Start difference. First operand 7965 states and 13197 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:51,962 INFO L93 Difference]: Finished difference Result 14871 states and 24608 transitions. [2025-02-05 17:05:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:05:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:52,002 INFO L225 Difference]: With dead ends: 14871 [2025-02-05 17:05:52,002 INFO L226 Difference]: Without dead ends: 9044 [2025-02-05 17:05:52,023 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-02-05 17:05:52,027 INFO L435 NwaCegarLoop]: 4317 mSDtfsCounter, 4603 mSDsluCounter, 8511 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4620 SdHoareTripleChecker+Valid, 12828 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:52,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4620 Valid, 12828 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:05:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2025-02-05 17:05:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 7965. [2025-02-05 17:05:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7965 states, 7484 states have (on average 1.6437733832175307) internal successors, (12302), 7552 states have internal predecessors, (12302), 311 states have call successors, (311), 102 states have call predecessors, (311), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-02-05 17:05:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7965 states to 7965 states and 13180 transitions. [2025-02-05 17:05:52,410 INFO L78 Accepts]: Start accepts. Automaton has 7965 states and 13180 transitions. Word has length 145 [2025-02-05 17:05:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:52,411 INFO L471 AbstractCegarLoop]: Abstraction has 7965 states and 13180 transitions. [2025-02-05 17:05:52,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 7965 states and 13180 transitions. [2025-02-05 17:05:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:52,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:52,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 17:05:52,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:05:52,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:52,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1840105787, now seen corresponding path program 1 times [2025-02-05 17:05:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:52,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842852275] [2025-02-05 17:05:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:52,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:52,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:52,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:52,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:52,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:52,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842852275] [2025-02-05 17:05:52,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842852275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:52,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:52,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:52,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197901703] [2025-02-05 17:05:52,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:52,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:52,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:52,609 INFO L87 Difference]: Start difference. First operand 7965 states and 13180 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:53,700 INFO L93 Difference]: Finished difference Result 20496 states and 33714 transitions. [2025-02-05 17:05:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:05:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:53,768 INFO L225 Difference]: With dead ends: 20496 [2025-02-05 17:05:53,768 INFO L226 Difference]: Without dead ends: 14669 [2025-02-05 17:05:53,792 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-02-05 17:05:53,795 INFO L435 NwaCegarLoop]: 4580 mSDtfsCounter, 4831 mSDsluCounter, 13794 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4848 SdHoareTripleChecker+Valid, 18374 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:53,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4848 Valid, 18374 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:05:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14669 states. [2025-02-05 17:05:54,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14669 to 14418. [2025-02-05 17:05:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14418 states, 13407 states have (on average 1.6267621391810247) internal successors, (21810), 13621 states have internal predecessors, (21810), 599 states have call successors, (599), 198 states have call predecessors, (599), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-02-05 17:05:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14418 states to 14418 states and 24032 transitions. [2025-02-05 17:05:54,452 INFO L78 Accepts]: Start accepts. Automaton has 14418 states and 24032 transitions. Word has length 145 [2025-02-05 17:05:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:54,452 INFO L471 AbstractCegarLoop]: Abstraction has 14418 states and 24032 transitions. [2025-02-05 17:05:54,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14418 states and 24032 transitions. [2025-02-05 17:05:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:54,460 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:54,460 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] [2025-02-05 17:05:54,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:05:54,460 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:54,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash -473699430, now seen corresponding path program 1 times [2025-02-05 17:05:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:54,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170332748] [2025-02-05 17:05:54,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:54,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:54,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:54,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:54,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170332748] [2025-02-05 17:05:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170332748] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157518815] [2025-02-05 17:05:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:54,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:54,617 INFO L87 Difference]: Start difference. First operand 14418 states and 24032 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:05:56,021 INFO L93 Difference]: Finished difference Result 43889 states and 74349 transitions. [2025-02-05 17:05:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:05:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:05:56,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:05:56,172 INFO L225 Difference]: With dead ends: 43889 [2025-02-05 17:05:56,173 INFO L226 Difference]: Without dead ends: 31609 [2025-02-05 17:05:56,216 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-02-05 17:05:56,217 INFO L435 NwaCegarLoop]: 4575 mSDtfsCounter, 5110 mSDsluCounter, 13774 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 18349 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:05:56,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 18349 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:05:56,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31609 states. [2025-02-05 17:05:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31609 to 28929. [2025-02-05 17:05:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28929 states, 26728 states have (on average 1.6335677940736306) internal successors, (43662), 27396 states have internal predecessors, (43662), 1143 states have call successors, (1143), 390 states have call predecessors, (1143), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-02-05 17:05:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28929 states to 28929 states and 50044 transitions. [2025-02-05 17:05:57,884 INFO L78 Accepts]: Start accepts. Automaton has 28929 states and 50044 transitions. Word has length 145 [2025-02-05 17:05:57,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:05:57,884 INFO L471 AbstractCegarLoop]: Abstraction has 28929 states and 50044 transitions. [2025-02-05 17:05:57,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:05:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 28929 states and 50044 transitions. [2025-02-05 17:05:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:05:57,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:05:57,899 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] [2025-02-05 17:05:57,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:05:57,899 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:05:57,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:05:57,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1656716965, now seen corresponding path program 1 times [2025-02-05 17:05:57,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:05:57,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847955038] [2025-02-05 17:05:57,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:05:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:05:57,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:05:57,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:05:57,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:05:57,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:05:58,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:05:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:05:58,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847955038] [2025-02-05 17:05:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847955038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:05:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:05:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:05:58,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532901634] [2025-02-05 17:05:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:05:58,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:05:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:05:58,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:05:58,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:05:58,037 INFO L87 Difference]: Start difference. First operand 28929 states and 50044 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:06:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:00,323 INFO L93 Difference]: Finished difference Result 92808 states and 167267 transitions. [2025-02-05 17:06:00,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:06:00,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:06:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:00,752 INFO L225 Difference]: With dead ends: 92808 [2025-02-05 17:06:00,753 INFO L226 Difference]: Without dead ends: 66017 [2025-02-05 17:06:00,824 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-02-05 17:06:00,825 INFO L435 NwaCegarLoop]: 4568 mSDtfsCounter, 5042 mSDsluCounter, 13755 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5069 SdHoareTripleChecker+Valid, 18323 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:00,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5069 Valid, 18323 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:06:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66017 states. [2025-02-05 17:06:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66017 to 61743. [2025-02-05 17:06:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.65034915708542) internal successors, (93588), 58770 states have internal predecessors, (93588), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:06:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114370 transitions. [2025-02-05 17:06:04,355 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114370 transitions. Word has length 145 [2025-02-05 17:06:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:04,356 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114370 transitions. [2025-02-05 17:06:04,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:06:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114370 transitions. [2025-02-05 17:06:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:06:04,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:04,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] [2025-02-05 17:06:04,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:06:04,380 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:04,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1354339164, now seen corresponding path program 1 times [2025-02-05 17:06:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115241480] [2025-02-05 17:06:04,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:04,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:06:04,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:06:04,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:04,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115241480] [2025-02-05 17:06:04,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115241480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:04,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:04,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656735118] [2025-02-05 17:06:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:04,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:04,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:04,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:04,480 INFO L87 Difference]: Start difference. First operand 61743 states and 114370 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:06:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:07,356 INFO L93 Difference]: Finished difference Result 138860 states and 269854 transitions. [2025-02-05 17:06:07,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:06:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:07,910 INFO L225 Difference]: With dead ends: 138860 [2025-02-05 17:06:07,911 INFO L226 Difference]: Without dead ends: 79255 [2025-02-05 17:06:08,117 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-02-05 17:06:08,117 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4594 mSDsluCounter, 8488 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 12794 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:08,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 12794 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:08,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79255 states. [2025-02-05 17:06:11,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79255 to 61743. [2025-02-05 17:06:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61743 states, 56708 states have (on average 1.6480743457713198) internal successors, (93459), 58770 states have internal predecessors, (93459), 2199 states have call successors, (2199), 774 states have call predecessors, (2199), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-02-05 17:06:12,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61743 states to 61743 states and 114241 transitions. [2025-02-05 17:06:12,068 INFO L78 Accepts]: Start accepts. Automaton has 61743 states and 114241 transitions. Word has length 145 [2025-02-05 17:06:12,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:06:12,068 INFO L471 AbstractCegarLoop]: Abstraction has 61743 states and 114241 transitions. [2025-02-05 17:06:12,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:06:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 61743 states and 114241 transitions. [2025-02-05 17:06:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 17:06:12,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:06:12,088 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] [2025-02-05 17:06:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:06:12,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:06:12,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:06:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1590017339, now seen corresponding path program 1 times [2025-02-05 17:06:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:06:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657742273] [2025-02-05 17:06:12,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:06:12,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:06:12,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 17:06:12,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 17:06:12,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:06:12,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:06:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:06:12,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:06:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657742273] [2025-02-05 17:06:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657742273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:06:12,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:06:12,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:06:12,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352987308] [2025-02-05 17:06:12,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:06:12,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:06:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:06:12,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:06:12,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:06:12,178 INFO L87 Difference]: Start difference. First operand 61743 states and 114241 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:06:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:06:15,712 INFO L93 Difference]: Finished difference Result 136671 states and 265218 transitions. [2025-02-05 17:06:15,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:06:15,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2025-02-05 17:06:15,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:06:16,136 INFO L225 Difference]: With dead ends: 136671 [2025-02-05 17:06:16,136 INFO L226 Difference]: Without dead ends: 77066 [2025-02-05 17:06:16,294 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-02-05 17:06:16,294 INFO L435 NwaCegarLoop]: 4303 mSDtfsCounter, 4591 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4608 SdHoareTripleChecker+Valid, 12786 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:06:16,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4608 Valid, 12786 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:06:16,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77066 states.