./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.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_label43+token_ring.11.cil-2.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 f02c38ef7caa0913e815c21ae4fcfcf6b07193a4f02fe1bf68067d0ca7ac604d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:10:34,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:10:34,189 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:10:34,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:10:34,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:10:34,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:10:34,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:10:34,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:10:34,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:10:34,224 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:10:34,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:10:34,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:10:34,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:10:34,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:10:34,225 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:10:34,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:10:34,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:10:34,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:10:34,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:10:34,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:10:34,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:10:34,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:10:34,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:10:34,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:10:34,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:10:34,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:10:34,229 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:10:34,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:10:34,229 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 -> f02c38ef7caa0913e815c21ae4fcfcf6b07193a4f02fe1bf68067d0ca7ac604d [2025-02-05 17:10:34,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:10:34,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:10:34,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:10:34,515 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:10:34,515 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:10:34,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c [2025-02-05 17:10:35,833 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0d959872/c95984b1514b4305b80ddb5de38c6fe4/FLAGc31fb8b72 [2025-02-05 17:10:36,660 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:10:36,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.11.cil-2.c [2025-02-05 17:10:36,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0d959872/c95984b1514b4305b80ddb5de38c6fe4/FLAGc31fb8b72 [2025-02-05 17:10:36,916 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0d959872/c95984b1514b4305b80ddb5de38c6fe4 [2025-02-05 17:10:36,918 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:10:36,919 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:10:36,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:10:36,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:10:36,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:10:36,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:10:36" (1/1) ... [2025-02-05 17:10:36,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3641e6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:36, skipping insertion in model container [2025-02-05 17:10:36,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:10:36" (1/1) ... [2025-02-05 17:10:37,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:10:38,440 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_label43+token_ring.11.cil-2.c[381679,381692] [2025-02-05 17:10:38,484 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_label43+token_ring.11.cil-2.c[383339,383352] [2025-02-05 17:10:38,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:10:38,812 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:10:39,581 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_label43+token_ring.11.cil-2.c[381679,381692] [2025-02-05 17:10:39,587 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_label43+token_ring.11.cil-2.c[383339,383352] [2025-02-05 17:10:39,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:10:39,688 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:10:39,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39 WrapperNode [2025-02-05 17:10:39,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:10:39,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:10:39,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:10:39,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:10:39,698 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:10:39" (1/1) ... [2025-02-05 17:10:39,792 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:10:39" (1/1) ... [2025-02-05 17:10:40,184 INFO L138 Inliner]: procedures = 66, calls = 74, calls flagged for inlining = 44, calls inlined = 44, statements flattened = 13128 [2025-02-05 17:10:40,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:10:40,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:10:40,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:10:40,186 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:10:40,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,351 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,451 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:10:40,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,675 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:10:40,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:10:40,931 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:10:40,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:10:40,933 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (1/1) ... [2025-02-05 17:10:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:10:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:10:40,983 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:10:40,987 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:10:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:10:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:10:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:10:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:10:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:10:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:10:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:10:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:10:41,014 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:10:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:10:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:10:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:10:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:10:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:10:41,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:10:41,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:10:41,175 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:10:41,177 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:10:49,255 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:10:49,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:10:49,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:10:49,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:10:49,256 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:10:49,257 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:10:49,257 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:10:49,545 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2025-02-05 17:10:49,546 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:10:49,619 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:10:49,623 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:10:49,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:49 BoogieIcfgContainer [2025-02-05 17:10:49,623 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:10:49,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:10:49,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:10:49,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:10:49,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:10:36" (1/3) ... [2025-02-05 17:10:49,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a068eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:49, skipping insertion in model container [2025-02-05 17:10:49,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:10:39" (2/3) ... [2025-02-05 17:10:49,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72a068eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:10:49, skipping insertion in model container [2025-02-05 17:10:49,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:10:49" (3/3) ... [2025-02-05 17:10:49,635 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.11.cil-2.c [2025-02-05 17:10:49,652 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:10:49,656 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.11.cil-2.c that has 7 procedures, 2564 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-02-05 17:10:49,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:10:49,798 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;@74df0c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:10:49,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:10:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 17:10:49,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:49,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:49,837 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:49,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:49,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:49,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1808491916, now seen corresponding path program 1 times [2025-02-05 17:10:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:49,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181252079] [2025-02-05 17:10:49,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:49,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:49,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:50,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:50,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:50,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:50,566 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:10:50,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:50,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181252079] [2025-02-05 17:10:50,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181252079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:50,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:50,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595427907] [2025-02-05 17:10:50,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:50,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:50,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:50,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:50,610 INFO L87 Difference]: Start difference. First operand has 2564 states, 2530 states have (on average 1.8304347826086957) internal successors, (4631), 2533 states have internal predecessors, (4631), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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:10:51,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:51,712 INFO L93 Difference]: Finished difference Result 5513 states and 9981 transitions. [2025-02-05 17:10:51,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:10:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:51,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:51,751 INFO L225 Difference]: With dead ends: 5513 [2025-02-05 17:10:51,752 INFO L226 Difference]: Without dead ends: 2898 [2025-02-05 17:10:51,767 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:10:51,771 INFO L435 NwaCegarLoop]: 4482 mSDtfsCounter, 5115 mSDsluCounter, 9229 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 13711 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:51,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 13711 Invalid, 645 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:10:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2898 states. [2025-02-05 17:10:51,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2898 to 2871. [2025-02-05 17:10:51,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7876200640341515) internal successors, (5025), 2814 states have internal predecessors, (5025), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:10:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5116 transitions. [2025-02-05 17:10:51,980 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5116 transitions. Word has length 167 [2025-02-05 17:10:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:51,982 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5116 transitions. [2025-02-05 17:10:51,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 4 states have internal predecessors, (157), 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:10:51,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5116 transitions. [2025-02-05 17:10:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:51,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:51,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:51,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:10:51,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:51,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1308698826, now seen corresponding path program 1 times [2025-02-05 17:10:51,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:51,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108692783] [2025-02-05 17:10:51,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:52,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:52,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:52,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:52,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:10:52,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:52,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108692783] [2025-02-05 17:10:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108692783] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:52,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089595804] [2025-02-05 17:10:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:52,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:52,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:52,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:52,373 INFO L87 Difference]: Start difference. First operand 2871 states and 5116 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:10:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:52,895 INFO L93 Difference]: Finished difference Result 3674 states and 6383 transitions. [2025-02-05 17:10:52,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:52,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:52,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:52,913 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 17:10:52,914 INFO L226 Difference]: Without dead ends: 2943 [2025-02-05 17:10:52,918 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:10:52,919 INFO L435 NwaCegarLoop]: 4401 mSDtfsCounter, 4736 mSDsluCounter, 8657 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4755 SdHoareTripleChecker+Valid, 13058 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:52,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4755 Valid, 13058 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:10:52,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2943 states. [2025-02-05 17:10:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2871. [2025-02-05 17:10:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2811 states have (on average 1.7869085734614016) internal successors, (5023), 2814 states have internal predecessors, (5023), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 17:10:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 5114 transitions. [2025-02-05 17:10:53,032 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 5114 transitions. Word has length 167 [2025-02-05 17:10:53,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:53,033 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 5114 transitions. [2025-02-05 17:10:53,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:10:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 5114 transitions. [2025-02-05 17:10:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:53,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:53,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:53,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:10:53,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1139555051, now seen corresponding path program 1 times [2025-02-05 17:10:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:53,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467154784] [2025-02-05 17:10:53,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:53,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:53,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:53,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:53,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:53,350 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:10:53,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:53,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467154784] [2025-02-05 17:10:53,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467154784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:53,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:53,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:53,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387997497] [2025-02-05 17:10:53,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:53,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:53,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:53,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:53,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:53,355 INFO L87 Difference]: Start difference. First operand 2871 states and 5114 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:54,371 INFO L93 Difference]: Finished difference Result 4069 states and 6993 transitions. [2025-02-05 17:10:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:54,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:54,393 INFO L225 Difference]: With dead ends: 4069 [2025-02-05 17:10:54,394 INFO L226 Difference]: Without dead ends: 3338 [2025-02-05 17:10:54,399 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:10:54,401 INFO L435 NwaCegarLoop]: 4725 mSDtfsCounter, 5048 mSDsluCounter, 14247 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5067 SdHoareTripleChecker+Valid, 18972 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:54,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5067 Valid, 18972 Invalid, 1047 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:10:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2025-02-05 17:10:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3219. [2025-02-05 17:10:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3219 states, 3132 states have (on average 1.7589399744572158) internal successors, (5509), 3136 states have internal predecessors, (5509), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-02-05 17:10:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3219 states to 3219 states and 5643 transitions. [2025-02-05 17:10:54,539 INFO L78 Accepts]: Start accepts. Automaton has 3219 states and 5643 transitions. Word has length 167 [2025-02-05 17:10:54,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:54,539 INFO L471 AbstractCegarLoop]: Abstraction has 3219 states and 5643 transitions. [2025-02-05 17:10:54,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3219 states and 5643 transitions. [2025-02-05 17:10:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:54,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:54,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:54,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:10:54,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:54,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1221205846, now seen corresponding path program 1 times [2025-02-05 17:10:54,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:54,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329964218] [2025-02-05 17:10:54,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:54,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:54,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:54,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:54,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:54,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:54,757 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:10:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329964218] [2025-02-05 17:10:54,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329964218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:54,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:54,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:54,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921737870] [2025-02-05 17:10:54,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:54,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:54,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:54,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:54,760 INFO L87 Difference]: Start difference. First operand 3219 states and 5643 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:55,731 INFO L93 Difference]: Finished difference Result 5174 states and 8701 transitions. [2025-02-05 17:10:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:55,758 INFO L225 Difference]: With dead ends: 5174 [2025-02-05 17:10:55,758 INFO L226 Difference]: Without dead ends: 4095 [2025-02-05 17:10:55,762 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:10:55,763 INFO L435 NwaCegarLoop]: 4721 mSDtfsCounter, 5043 mSDsluCounter, 14235 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5062 SdHoareTripleChecker+Valid, 18956 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:55,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5062 Valid, 18956 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:10:55,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2025-02-05 17:10:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 3958. [2025-02-05 17:10:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3958 states, 3815 states have (on average 1.7195281782437746) internal successors, (6560), 3823 states have internal predecessors, (6560), 105 states have call successors, (105), 30 states have call predecessors, (105), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-02-05 17:10:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 6786 transitions. [2025-02-05 17:10:55,908 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 6786 transitions. Word has length 167 [2025-02-05 17:10:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:55,908 INFO L471 AbstractCegarLoop]: Abstraction has 3958 states and 6786 transitions. [2025-02-05 17:10:55,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 6786 transitions. [2025-02-05 17:10:55,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:55,912 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:55,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:55,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:10:55,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:55,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:55,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1196492555, now seen corresponding path program 1 times [2025-02-05 17:10:55,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:55,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611380408] [2025-02-05 17:10:55,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:55,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:55,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:55,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:55,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:55,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:56,106 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:10:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611380408] [2025-02-05 17:10:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611380408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:56,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728037367] [2025-02-05 17:10:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:56,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:56,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:56,109 INFO L87 Difference]: Start difference. First operand 3958 states and 6786 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:56,968 INFO L93 Difference]: Finished difference Result 7551 states and 12454 transitions. [2025-02-05 17:10:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:56,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:56,998 INFO L225 Difference]: With dead ends: 7551 [2025-02-05 17:10:56,999 INFO L226 Difference]: Without dead ends: 5733 [2025-02-05 17:10:57,008 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:10:57,010 INFO L435 NwaCegarLoop]: 4718 mSDtfsCounter, 5038 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5057 SdHoareTripleChecker+Valid, 18944 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:57,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5057 Valid, 18944 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:10:57,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5733 states. [2025-02-05 17:10:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5733 to 5559. [2025-02-05 17:10:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5559 states, 5298 states have (on average 1.6776141940354852) internal successors, (8888), 5320 states have internal predecessors, (8888), 185 states have call successors, (185), 54 states have call predecessors, (185), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-02-05 17:10:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5559 states to 5559 states and 9322 transitions. [2025-02-05 17:10:57,210 INFO L78 Accepts]: Start accepts. Automaton has 5559 states and 9322 transitions. Word has length 167 [2025-02-05 17:10:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:57,211 INFO L471 AbstractCegarLoop]: Abstraction has 5559 states and 9322 transitions. [2025-02-05 17:10:57,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:57,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5559 states and 9322 transitions. [2025-02-05 17:10:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:57,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:57,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:57,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:10:57,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1274482826, now seen corresponding path program 1 times [2025-02-05 17:10:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056638675] [2025-02-05 17:10:57,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:57,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:57,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:57,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:57,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:57,385 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:10:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056638675] [2025-02-05 17:10:57,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056638675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:57,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:57,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:10:57,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392237750] [2025-02-05 17:10:57,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:57,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:10:57,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:57,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:10:57,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:10:57,387 INFO L87 Difference]: Start difference. First operand 5559 states and 9322 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:58,425 INFO L93 Difference]: Finished difference Result 12778 states and 20948 transitions. [2025-02-05 17:10:58,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:10:58,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:58,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:58,477 INFO L225 Difference]: With dead ends: 12778 [2025-02-05 17:10:58,477 INFO L226 Difference]: Without dead ends: 9359 [2025-02-05 17:10:58,488 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:10:58,490 INFO L435 NwaCegarLoop]: 4715 mSDtfsCounter, 5033 mSDsluCounter, 14217 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5052 SdHoareTripleChecker+Valid, 18932 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:58,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5052 Valid, 18932 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:10:58,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2025-02-05 17:10:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9112. [2025-02-05 17:10:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6503431429568454) internal successors, (14188), 8665 states have internal predecessors, (14188), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:10:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15134 transitions. [2025-02-05 17:10:58,785 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15134 transitions. Word has length 167 [2025-02-05 17:10:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:58,786 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15134 transitions. [2025-02-05 17:10:58,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:10:58,787 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15134 transitions. [2025-02-05 17:10:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:58,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:58,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:58,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:10:58,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:58,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1078306005, now seen corresponding path program 1 times [2025-02-05 17:10:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57546715] [2025-02-05 17:10:58,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:58,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:58,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:58,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:58,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:10:58,943 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:10:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:10:58,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57546715] [2025-02-05 17:10:58,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57546715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:10:58,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:10:58,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:10:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433282489] [2025-02-05 17:10:58,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:10:58,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:10:58,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:10:58,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:10:58,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:10:58,946 INFO L87 Difference]: Start difference. First operand 9112 states and 15134 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:10:59,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:10:59,474 INFO L93 Difference]: Finished difference Result 17578 states and 29308 transitions. [2025-02-05 17:10:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:10:59,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:10:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:10:59,522 INFO L225 Difference]: With dead ends: 17578 [2025-02-05 17:10:59,522 INFO L226 Difference]: Without dead ends: 10606 [2025-02-05 17:10:59,548 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:10:59,550 INFO L435 NwaCegarLoop]: 4388 mSDtfsCounter, 4728 mSDsluCounter, 8632 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4747 SdHoareTripleChecker+Valid, 13020 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:10:59,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4747 Valid, 13020 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:10:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10606 states. [2025-02-05 17:10:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10606 to 9112. [2025-02-05 17:10:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6483657089682446) internal successors, (14171), 8665 states have internal predecessors, (14171), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:10:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15117 transitions. [2025-02-05 17:10:59,969 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15117 transitions. Word has length 167 [2025-02-05 17:10:59,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:10:59,970 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15117 transitions. [2025-02-05 17:10:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:10:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15117 transitions. [2025-02-05 17:10:59,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:10:59,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:10:59,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:10:59,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:10:59,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:10:59,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:10:59,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2137119244, now seen corresponding path program 1 times [2025-02-05 17:10:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:10:59,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900017212] [2025-02-05 17:10:59,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:10:59,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:10:59,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:10:59,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:10:59,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:10:59,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:00,135 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:11:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:00,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900017212] [2025-02-05 17:11:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900017212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512643462] [2025-02-05 17:11:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:00,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:00,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:00,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:00,137 INFO L87 Difference]: Start difference. First operand 9112 states and 15117 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:00,699 INFO L93 Difference]: Finished difference Result 17495 states and 29108 transitions. [2025-02-05 17:11:00,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:00,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:00,751 INFO L225 Difference]: With dead ends: 17495 [2025-02-05 17:11:00,751 INFO L226 Difference]: Without dead ends: 10523 [2025-02-05 17:11:00,778 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:11:00,779 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 4725 mSDsluCounter, 8627 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 13012 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:00,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 13012 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2025-02-05 17:11:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 9112. [2025-02-05 17:11:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9112 states, 8597 states have (on average 1.6463882749796441) internal successors, (14154), 8665 states have internal predecessors, (14154), 345 states have call successors, (345), 102 states have call predecessors, (345), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-02-05 17:11:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9112 states to 9112 states and 15100 transitions. [2025-02-05 17:11:01,122 INFO L78 Accepts]: Start accepts. Automaton has 9112 states and 15100 transitions. Word has length 167 [2025-02-05 17:11:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:01,123 INFO L471 AbstractCegarLoop]: Abstraction has 9112 states and 15100 transitions. [2025-02-05 17:11:01,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9112 states and 15100 transitions. [2025-02-05 17:11:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:01,129 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:01,129 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:01,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:11:01,130 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:01,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2102295307, now seen corresponding path program 1 times [2025-02-05 17:11:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798757355] [2025-02-05 17:11:01,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:01,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:01,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:01,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:01,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:01,370 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:11:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:01,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798757355] [2025-02-05 17:11:01,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798757355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:01,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:01,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764737760] [2025-02-05 17:11:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:01,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:01,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:01,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:01,374 INFO L87 Difference]: Start difference. First operand 9112 states and 15100 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:11:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:02,816 INFO L93 Difference]: Finished difference Result 24277 states and 40176 transitions. [2025-02-05 17:11:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:02,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:02,896 INFO L225 Difference]: With dead ends: 24277 [2025-02-05 17:11:02,896 INFO L226 Difference]: Without dead ends: 17305 [2025-02-05 17:11:02,926 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:11:02,927 INFO L435 NwaCegarLoop]: 4698 mSDtfsCounter, 5009 mSDsluCounter, 14170 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5028 SdHoareTripleChecker+Valid, 18868 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:02,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5028 Valid, 18868 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:11:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17305 states. [2025-02-05 17:11:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17305 to 16974. [2025-02-05 17:11:03,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6395546329496131) internal successors, (26064), 16111 states have internal predecessors, (26064), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:11:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28418 transitions. [2025-02-05 17:11:03,666 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28418 transitions. Word has length 167 [2025-02-05 17:11:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28418 transitions. [2025-02-05 17:11:03,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:11:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28418 transitions. [2025-02-05 17:11:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:03,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:03,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:03,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:11:03,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:03,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash 254132692, now seen corresponding path program 1 times [2025-02-05 17:11:03,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:03,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974628662] [2025-02-05 17:11:03,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:03,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:03,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:03,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:03,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:03,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:03,800 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:11:03,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:03,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974628662] [2025-02-05 17:11:03,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974628662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:03,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:03,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:03,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469225112] [2025-02-05 17:11:03,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:03,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:03,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:03,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:03,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:03,802 INFO L87 Difference]: Start difference. First operand 16974 states and 28418 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:04,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:04,596 INFO L93 Difference]: Finished difference Result 35483 states and 60552 transitions. [2025-02-05 17:11:04,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:04,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:04,677 INFO L225 Difference]: With dead ends: 35483 [2025-02-05 17:11:04,677 INFO L226 Difference]: Without dead ends: 20649 [2025-02-05 17:11:04,721 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:11:04,721 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4721 mSDsluCounter, 8618 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 12998 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:04,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 12998 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:04,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20649 states. [2025-02-05 17:11:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20649 to 16974. [2025-02-05 17:11:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.637478769579166) internal successors, (26031), 16111 states have internal predecessors, (26031), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:11:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28385 transitions. [2025-02-05 17:11:05,462 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28385 transitions. Word has length 167 [2025-02-05 17:11:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28385 transitions. [2025-02-05 17:11:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:05,464 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28385 transitions. [2025-02-05 17:11:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:05,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:05,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:05,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:11:05,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:05,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1193874155, now seen corresponding path program 1 times [2025-02-05 17:11:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280340161] [2025-02-05 17:11:05,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:05,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:05,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:05,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:05,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:05,598 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:11:05,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:05,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280340161] [2025-02-05 17:11:05,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280340161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:05,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:05,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:05,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383953556] [2025-02-05 17:11:05,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:05,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:05,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:05,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:05,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:05,602 INFO L87 Difference]: Start difference. First operand 16974 states and 28385 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:06,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:06,630 INFO L93 Difference]: Finished difference Result 35238 states and 59996 transitions. [2025-02-05 17:11:06,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:06,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:06,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:06,706 INFO L225 Difference]: With dead ends: 35238 [2025-02-05 17:11:06,706 INFO L226 Difference]: Without dead ends: 20404 [2025-02-05 17:11:06,740 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:11:06,742 INFO L435 NwaCegarLoop]: 4377 mSDtfsCounter, 4718 mSDsluCounter, 8613 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12990 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:06,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12990 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:06,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20404 states. [2025-02-05 17:11:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20404 to 16974. [2025-02-05 17:11:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16974 states, 15897 states have (on average 1.6354029062087185) internal successors, (25998), 16111 states have internal predecessors, (25998), 665 states have call successors, (665), 198 states have call predecessors, (665), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-02-05 17:11:07,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16974 states to 16974 states and 28352 transitions. [2025-02-05 17:11:07,554 INFO L78 Accepts]: Start accepts. Automaton has 16974 states and 28352 transitions. Word has length 167 [2025-02-05 17:11:07,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:07,554 INFO L471 AbstractCegarLoop]: Abstraction has 16974 states and 28352 transitions. [2025-02-05 17:11:07,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 16974 states and 28352 transitions. [2025-02-05 17:11:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:07,564 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:07,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:07,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:11:07,564 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:07,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash 144889268, now seen corresponding path program 1 times [2025-02-05 17:11:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:07,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695177267] [2025-02-05 17:11:07,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:07,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:07,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:07,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:07,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:07,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:07,740 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:11:07,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:07,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695177267] [2025-02-05 17:11:07,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695177267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:07,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:07,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43392080] [2025-02-05 17:11:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:07,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:07,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:07,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:07,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:07,744 INFO L87 Difference]: Start difference. First operand 16974 states and 28352 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:11:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:09,914 INFO L93 Difference]: Finished difference Result 52501 states and 89027 transitions. [2025-02-05 17:11:09,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:09,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:10,068 INFO L225 Difference]: With dead ends: 52501 [2025-02-05 17:11:10,068 INFO L226 Difference]: Without dead ends: 37667 [2025-02-05 17:11:10,112 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:11:10,113 INFO L435 NwaCegarLoop]: 4683 mSDtfsCounter, 5332 mSDsluCounter, 14122 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5363 SdHoareTripleChecker+Valid, 18805 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:10,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5363 Valid, 18805 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 17:11:10,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37667 states. [2025-02-05 17:11:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37667 to 34465. [2025-02-05 17:11:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6466670815958175) internal successors, (52914), 32802 states have internal predecessors, (52914), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:11:11,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59556 transitions. [2025-02-05 17:11:11,476 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59556 transitions. Word has length 167 [2025-02-05 17:11:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:11,476 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59556 transitions. [2025-02-05 17:11:11,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:11:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59556 transitions. [2025-02-05 17:11:11,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:11,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:11,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:11,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:11:11,491 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:11,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:11,492 INFO L85 PathProgramCache]: Analyzing trace with hash 326622517, now seen corresponding path program 1 times [2025-02-05 17:11:11,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:11,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512226424] [2025-02-05 17:11:11,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:11,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:11,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:11,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:11,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:11,604 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:11:11,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:11,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512226424] [2025-02-05 17:11:11,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512226424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:11,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532416414] [2025-02-05 17:11:11,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:11,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:11,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:11,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:11,607 INFO L87 Difference]: Start difference. First operand 34465 states and 59556 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:13,662 INFO L93 Difference]: Finished difference Result 75562 states and 134700 transitions. [2025-02-05 17:11:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:13,850 INFO L225 Difference]: With dead ends: 75562 [2025-02-05 17:11:13,850 INFO L226 Difference]: Without dead ends: 43237 [2025-02-05 17:11:13,930 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:11:13,931 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4712 mSDsluCounter, 8602 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4731 SdHoareTripleChecker+Valid, 12974 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:13,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4731 Valid, 12974 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:11:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43237 states. [2025-02-05 17:11:16,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43237 to 34465. [2025-02-05 17:11:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.644644301985436) internal successors, (52849), 32802 states have internal predecessors, (52849), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:11:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59491 transitions. [2025-02-05 17:11:16,727 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59491 transitions. Word has length 167 [2025-02-05 17:11:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:16,728 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59491 transitions. [2025-02-05 17:11:16,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:16,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59491 transitions. [2025-02-05 17:11:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:16,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:16,739 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:16,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:11:16,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:16,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash 471032212, now seen corresponding path program 1 times [2025-02-05 17:11:16,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:16,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92524139] [2025-02-05 17:11:16,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:16,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:16,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:16,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:16,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:16,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:16,852 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:11:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92524139] [2025-02-05 17:11:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92524139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780636285] [2025-02-05 17:11:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:16,855 INFO L87 Difference]: Start difference. First operand 34465 states and 59491 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:18,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:18,588 INFO L93 Difference]: Finished difference Result 74100 states and 131646 transitions. [2025-02-05 17:11:18,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:18,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:18,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:18,796 INFO L225 Difference]: With dead ends: 74100 [2025-02-05 17:11:18,796 INFO L226 Difference]: Without dead ends: 41775 [2025-02-05 17:11:18,901 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:11:18,902 INFO L435 NwaCegarLoop]: 4367 mSDtfsCounter, 4708 mSDsluCounter, 8593 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4727 SdHoareTripleChecker+Valid, 12960 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:18,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4727 Valid, 12960 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41775 states. [2025-02-05 17:11:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41775 to 34465. [2025-02-05 17:11:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6426215223750544) internal successors, (52784), 32802 states have internal predecessors, (52784), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:11:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59426 transitions. [2025-02-05 17:11:20,619 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59426 transitions. Word has length 167 [2025-02-05 17:11:20,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:20,620 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59426 transitions. [2025-02-05 17:11:20,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59426 transitions. [2025-02-05 17:11:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:20,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:20,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:20,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:11:20,631 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:20,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1338871373, now seen corresponding path program 1 times [2025-02-05 17:11:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664453158] [2025-02-05 17:11:20,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:20,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:20,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:20,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:20,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:20,755 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:11:20,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:20,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664453158] [2025-02-05 17:11:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664453158] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:11:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340734513] [2025-02-05 17:11:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:20,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:11:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:20,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:11:20,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:11:20,758 INFO L87 Difference]: Start difference. First operand 34465 states and 59426 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:23,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:23,032 INFO L93 Difference]: Finished difference Result 73369 states and 130054 transitions. [2025-02-05 17:11:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:11:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:23,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:23,264 INFO L225 Difference]: With dead ends: 73369 [2025-02-05 17:11:23,264 INFO L226 Difference]: Without dead ends: 41044 [2025-02-05 17:11:23,393 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:11:23,394 INFO L435 NwaCegarLoop]: 4364 mSDtfsCounter, 4705 mSDsluCounter, 8588 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4724 SdHoareTripleChecker+Valid, 12952 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:23,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4724 Valid, 12952 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:11:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41044 states. [2025-02-05 17:11:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41044 to 34465. [2025-02-05 17:11:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34465 states, 32134 states have (on average 1.6405987427646729) internal successors, (52719), 32802 states have internal predecessors, (52719), 1273 states have call successors, (1273), 390 states have call predecessors, (1273), 1056 states have return successors, (5369), 1336 states have call predecessors, (5369), 1273 states have call successors, (5369) [2025-02-05 17:11:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34465 states to 34465 states and 59361 transitions. [2025-02-05 17:11:24,965 INFO L78 Accepts]: Start accepts. Automaton has 34465 states and 59361 transitions. Word has length 167 [2025-02-05 17:11:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:11:24,965 INFO L471 AbstractCegarLoop]: Abstraction has 34465 states and 59361 transitions. [2025-02-05 17:11:24,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:11:24,966 INFO L276 IsEmpty]: Start isEmpty. Operand 34465 states and 59361 transitions. [2025-02-05 17:11:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 17:11:24,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:11:24,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:11:24,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:11:24,977 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:11:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:11:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1812897356, now seen corresponding path program 1 times [2025-02-05 17:11:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:11:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542224911] [2025-02-05 17:11:24,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:11:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:11:24,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 17:11:24,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 17:11:24,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:11:24,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:11:25,357 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:11:25,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:11:25,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542224911] [2025-02-05 17:11:25,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542224911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:11:25,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:11:25,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:11:25,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690396356] [2025-02-05 17:11:25,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:11:25,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:11:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:11:25,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:11:25,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:11:25,359 INFO L87 Difference]: Start difference. First operand 34465 states and 59361 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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:11:28,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:11:28,027 INFO L93 Difference]: Finished difference Result 108112 states and 193016 transitions. [2025-02-05 17:11:28,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:11:28,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 states have internal predecessors, (157), 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 167 [2025-02-05 17:11:28,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:11:28,313 INFO L225 Difference]: With dead ends: 108112 [2025-02-05 17:11:28,314 INFO L226 Difference]: Without dead ends: 75787 [2025-02-05 17:11:28,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:11:28,407 INFO L435 NwaCegarLoop]: 4661 mSDtfsCounter, 5150 mSDsluCounter, 14061 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5181 SdHoareTripleChecker+Valid, 18722 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:11:28,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5181 Valid, 18722 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:11:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75787 states.