./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_label46+token_ring.08.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 fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:23:42,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:23:42,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:23:42,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:23:42,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:23:42,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:23:42,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:23:42,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:23:42,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:23:42,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:23:42,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:23:42,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:23:42,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:23:42,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:23:42,615 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:23:42,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:23:42,616 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:23:42,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:42,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:42,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:23:42,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:23:42,618 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:23:42,618 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:23:42,618 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:23:42,618 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:23:42,618 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:23:42,618 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:23:42,618 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 -> fde4aa10540dafc8826e147080809d5acc35a439830c8d5d4d25a271d8a78822 [2025-01-09 05:23:42,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:23:42,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:23:42,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:23:42,871 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:23:42,871 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:23:42,872 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2025-01-09 05:23:44,148 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56a04a79c/ec3040dd6e46418ea37c0e85cc292517/FLAGa7f20218b [2025-01-09 05:23:44,876 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:23:44,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.08.cil-2.c [2025-01-09 05:23:44,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56a04a79c/ec3040dd6e46418ea37c0e85cc292517/FLAGa7f20218b [2025-01-09 05:23:44,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56a04a79c/ec3040dd6e46418ea37c0e85cc292517 [2025-01-09 05:23:44,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:23:44,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:23:44,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:23:44,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:23:44,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:23:44,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:23:44" (1/1) ... [2025-01-09 05:23:44,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d7fc37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:44, skipping insertion in model container [2025-01-09 05:23:44,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:23:44" (1/1) ... [2025-01-09 05:23:45,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:23:46,315 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_label46+token_ring.08.cil-2.c[382357,382370] [2025-01-09 05:23:46,342 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_label46+token_ring.08.cil-2.c[383339,383352] [2025-01-09 05:23:46,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:23:46,583 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:23:47,101 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_label46+token_ring.08.cil-2.c[382357,382370] [2025-01-09 05:23:47,104 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_label46+token_ring.08.cil-2.c[383339,383352] [2025-01-09 05:23:47,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:23:47,172 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:23:47,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47 WrapperNode [2025-01-09 05:23:47,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:23:47,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:23:47,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:23:47,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:23:47,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,513 INFO L138 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 12963 [2025-01-09 05:23:47,514 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:23:47,515 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:23:47,515 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:23:47,515 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:23:47,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,559 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,627 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-01-09 05:23:47,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:23:47,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:23:47,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:23:47,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:23:47,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (1/1) ... [2025-01-09 05:23:47,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:23:47,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:47,975 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-01-09 05:23:47,977 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-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:23:47,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:23:47,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:23:48,072 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:23:48,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:23:54,611 INFO L? ?]: Removed 1735 outVars from TransFormulas that were not future-live. [2025-01-09 05:23:54,611 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:23:54,672 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:23:54,672 INFO L312 CfgBuilder]: Removed 12 assume(true) statements. [2025-01-09 05:23:54,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:23:54 BoogieIcfgContainer [2025-01-09 05:23:54,673 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:23:54,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:23:54,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:23:54,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:23:54,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:23:44" (1/3) ... [2025-01-09 05:23:54,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222c1173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:23:54, skipping insertion in model container [2025-01-09 05:23:54,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:23:47" (2/3) ... [2025-01-09 05:23:54,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222c1173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:23:54, skipping insertion in model container [2025-01-09 05:23:54,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:23:54" (3/3) ... [2025-01-09 05:23:54,685 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.08.cil-2.c [2025-01-09 05:23:54,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:23:54,698 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.08.cil-2.c that has 8 procedures, 2471 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-01-09 05:23:54,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:23:54,784 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;@54163226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:23:54,785 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:23:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 2471 states, 2438 states have (on average 1.843724364232978) internal successors, (4495), 2442 states have internal predecessors, (4495), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:23:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:23:54,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:54,822 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] [2025-01-09 05:23:54,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:54,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash -889799695, now seen corresponding path program 1 times [2025-01-09 05:23:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:54,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036813499] [2025-01-09 05:23:54,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:55,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:23:55,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:23:55,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:55,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:55,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036813499] [2025-01-09 05:23:55,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036813499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:55,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:55,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:23:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822398578] [2025-01-09 05:23:55,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:55,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:55,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:55,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:55,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:23:55,316 INFO L87 Difference]: Start difference. First operand has 2471 states, 2438 states have (on average 1.843724364232978) internal successors, (4495), 2442 states have internal predecessors, (4495), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:55,510 INFO L93 Difference]: Finished difference Result 4934 states and 9073 transitions. [2025-01-09 05:23:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:23:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:23:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:55,545 INFO L225 Difference]: With dead ends: 4934 [2025-01-09 05:23:55,547 INFO L226 Difference]: Without dead ends: 2403 [2025-01-09 05:23:55,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:23:55,566 INFO L435 NwaCegarLoop]: 4466 mSDtfsCounter, 438 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 8488 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:55,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 8488 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:23:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2025-01-09 05:23:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2403. [2025-01-09 05:23:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 2371 states have (on average 1.8355124420075917) internal successors, (4352), 2374 states have internal predecessors, (4352), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 05:23:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 4398 transitions. [2025-01-09 05:23:55,699 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 4398 transitions. Word has length 133 [2025-01-09 05:23:55,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:55,700 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 4398 transitions. [2025-01-09 05:23:55,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:55,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 4398 transitions. [2025-01-09 05:23:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:23:55,707 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:55,708 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] [2025-01-09 05:23:55,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:23:55,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:55,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:55,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1751633297, now seen corresponding path program 1 times [2025-01-09 05:23:55,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:55,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493024316] [2025-01-09 05:23:55,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:55,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:55,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:23:55,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:23:55,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:55,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493024316] [2025-01-09 05:23:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493024316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:23:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352341139] [2025-01-09 05:23:55,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:55,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:23:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:55,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:23:55,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:23:55,944 INFO L87 Difference]: Start difference. First operand 2403 states and 4398 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:56,576 INFO L93 Difference]: Finished difference Result 2967 states and 5292 transitions. [2025-01-09 05:23:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:23:56,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:23:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:56,590 INFO L225 Difference]: With dead ends: 2967 [2025-01-09 05:23:56,591 INFO L226 Difference]: Without dead ends: 2701 [2025-01-09 05:23:56,593 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-01-09 05:23:56,593 INFO L435 NwaCegarLoop]: 4300 mSDtfsCounter, 4780 mSDsluCounter, 8781 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4796 SdHoareTripleChecker+Valid, 13081 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:56,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4796 Valid, 13081 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:23:56,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2025-01-09 05:23:56,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2678. [2025-01-09 05:23:56,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2678 states, 2622 states have (on average 1.8123569794050343) internal successors, (4752), 2626 states have internal predecessors, (4752), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-01-09 05:23:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 4833 transitions. [2025-01-09 05:23:56,663 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 4833 transitions. Word has length 133 [2025-01-09 05:23:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:56,664 INFO L471 AbstractCegarLoop]: Abstraction has 2678 states and 4833 transitions. [2025-01-09 05:23:56,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 4833 transitions. [2025-01-09 05:23:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:23:56,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:56,667 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] [2025-01-09 05:23:56,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:23:56,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:56,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash -144113813, now seen corresponding path program 1 times [2025-01-09 05:23:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:56,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225119357] [2025-01-09 05:23:56,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:56,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:56,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:23:56,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:23:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225119357] [2025-01-09 05:23:56,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225119357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:56,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:56,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543267880] [2025-01-09 05:23:56,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:56,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:56,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:56,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:56,873 INFO L87 Difference]: Start difference. First operand 2678 states and 4833 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:57,470 INFO L93 Difference]: Finished difference Result 3570 states and 6259 transitions. [2025-01-09 05:23:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:57,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:23:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:57,481 INFO L225 Difference]: With dead ends: 3570 [2025-01-09 05:23:57,482 INFO L226 Difference]: Without dead ends: 3029 [2025-01-09 05:23:57,484 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-01-09 05:23:57,485 INFO L435 NwaCegarLoop]: 4534 mSDtfsCounter, 4781 mSDsluCounter, 13619 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4797 SdHoareTripleChecker+Valid, 18153 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:57,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4797 Valid, 18153 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:23:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2025-01-09 05:23:57,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2934. [2025-01-09 05:23:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2854 states have (on average 1.7918710581639803) internal successors, (5114), 2859 states have internal predecessors, (5114), 58 states have call successors, (58), 19 states have call predecessors, (58), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-01-09 05:23:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 5232 transitions. [2025-01-09 05:23:57,559 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 5232 transitions. Word has length 133 [2025-01-09 05:23:57,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:57,560 INFO L471 AbstractCegarLoop]: Abstraction has 2934 states and 5232 transitions. [2025-01-09 05:23:57,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:57,560 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 5232 transitions. [2025-01-09 05:23:57,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:23:57,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:57,563 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] [2025-01-09 05:23:57,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:23:57,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:57,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:57,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1583031149, now seen corresponding path program 1 times [2025-01-09 05:23:57,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:57,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871072105] [2025-01-09 05:23:57,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:57,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:57,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:23:57,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:23:57,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:57,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871072105] [2025-01-09 05:23:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871072105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:57,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:57,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316058757] [2025-01-09 05:23:57,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:57,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:57,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:57,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:57,735 INFO L87 Difference]: Start difference. First operand 2934 states and 5232 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:58,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:58,302 INFO L93 Difference]: Finished difference Result 4384 states and 7547 transitions. [2025-01-09 05:23:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:58,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:23:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:58,324 INFO L225 Difference]: With dead ends: 4384 [2025-01-09 05:23:58,324 INFO L226 Difference]: Without dead ends: 3587 [2025-01-09 05:23:58,331 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-01-09 05:23:58,335 INFO L435 NwaCegarLoop]: 4326 mSDtfsCounter, 4801 mSDsluCounter, 13126 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4817 SdHoareTripleChecker+Valid, 17452 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:58,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4817 Valid, 17452 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3587 states. [2025-01-09 05:23:58,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3587 to 3479. [2025-01-09 05:23:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3349 states have (on average 1.7608241266049567) internal successors, (5897), 3358 states have internal predecessors, (5897), 92 states have call successors, (92), 31 states have call predecessors, (92), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-01-09 05:23:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 6095 transitions. [2025-01-09 05:23:58,565 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 6095 transitions. Word has length 133 [2025-01-09 05:23:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:58,565 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 6095 transitions. [2025-01-09 05:23:58,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 6095 transitions. [2025-01-09 05:23:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:23:58,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:58,567 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] [2025-01-09 05:23:58,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:23:58,567 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:58,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:58,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2054387499, now seen corresponding path program 1 times [2025-01-09 05:23:58,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:58,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895074462] [2025-01-09 05:23:58,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:58,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:58,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:23:58,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:23:58,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:58,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:58,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:58,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895074462] [2025-01-09 05:23:58,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895074462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134788294] [2025-01-09 05:23:58,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:58,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:58,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:58,740 INFO L87 Difference]: Start difference. First operand 3479 states and 6095 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:59,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:59,561 INFO L93 Difference]: Finished difference Result 6139 states and 10380 transitions. [2025-01-09 05:23:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:59,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:23:59,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:59,586 INFO L225 Difference]: With dead ends: 6139 [2025-01-09 05:23:59,586 INFO L226 Difference]: Without dead ends: 4797 [2025-01-09 05:23:59,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:23:59,594 INFO L435 NwaCegarLoop]: 4527 mSDtfsCounter, 4771 mSDsluCounter, 13598 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4787 SdHoareTripleChecker+Valid, 18125 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:59,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4787 Valid, 18125 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:23:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4797 states. [2025-01-09 05:23:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4797 to 4662. [2025-01-09 05:23:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4662 states, 4426 states have (on average 1.7236782647989155) internal successors, (7629), 4449 states have internal predecessors, (7629), 160 states have call successors, (160), 55 states have call predecessors, (160), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-01-09 05:23:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4662 states to 4662 states and 8011 transitions. [2025-01-09 05:23:59,817 INFO L78 Accepts]: Start accepts. Automaton has 4662 states and 8011 transitions. Word has length 133 [2025-01-09 05:23:59,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:59,818 INFO L471 AbstractCegarLoop]: Abstraction has 4662 states and 8011 transitions. [2025-01-09 05:23:59,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:59,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4662 states and 8011 transitions. [2025-01-09 05:23:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:23:59,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:59,824 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] [2025-01-09 05:23:59,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:23:59,824 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:59,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:59,825 INFO L85 PathProgramCache]: Analyzing trace with hash 407024557, now seen corresponding path program 1 times [2025-01-09 05:23:59,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:59,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896251053] [2025-01-09 05:23:59,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:59,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:59,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:23:59,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:23:59,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:59,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896251053] [2025-01-09 05:23:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896251053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:59,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:59,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679797271] [2025-01-09 05:23:59,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:59,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:59,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:59,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:59,976 INFO L87 Difference]: Start difference. First operand 4662 states and 8011 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:00,769 INFO L93 Difference]: Finished difference Result 9964 states and 16718 transitions. [2025-01-09 05:24:00,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:00,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:00,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:00,802 INFO L225 Difference]: With dead ends: 9964 [2025-01-09 05:24:00,802 INFO L226 Difference]: Without dead ends: 7439 [2025-01-09 05:24:00,811 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-01-09 05:24:00,812 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4763 mSDsluCounter, 13579 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4779 SdHoareTripleChecker+Valid, 18099 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:00,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4779 Valid, 18099 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7439 states. [2025-01-09 05:24:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7439 to 7262. [2025-01-09 05:24:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7262 states, 6796 states have (on average 1.692613301942319) internal successors, (11503), 6865 states have internal predecessors, (11503), 296 states have call successors, (296), 103 states have call predecessors, (296), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-01-09 05:24:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7262 states to 7262 states and 12349 transitions. [2025-01-09 05:24:01,064 INFO L78 Accepts]: Start accepts. Automaton has 7262 states and 12349 transitions. Word has length 133 [2025-01-09 05:24:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:01,064 INFO L471 AbstractCegarLoop]: Abstraction has 7262 states and 12349 transitions. [2025-01-09 05:24:01,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 7262 states and 12349 transitions. [2025-01-09 05:24:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:24:01,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:01,073 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] [2025-01-09 05:24:01,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:24:01,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:01,074 INFO L85 PathProgramCache]: Analyzing trace with hash -631560017, now seen corresponding path program 1 times [2025-01-09 05:24:01,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:01,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889469517] [2025-01-09 05:24:01,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:01,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:24:01,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:24:01,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:01,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:01,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889469517] [2025-01-09 05:24:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889469517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:01,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047998369] [2025-01-09 05:24:01,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:01,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:01,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:01,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:01,171 INFO L87 Difference]: Start difference. First operand 7262 states and 12349 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:01,939 INFO L93 Difference]: Finished difference Result 18532 states and 31482 transitions. [2025-01-09 05:24:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:01,987 INFO L225 Difference]: With dead ends: 18532 [2025-01-09 05:24:01,987 INFO L226 Difference]: Without dead ends: 13407 [2025-01-09 05:24:02,007 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-01-09 05:24:02,009 INFO L435 NwaCegarLoop]: 4517 mSDtfsCounter, 4758 mSDsluCounter, 13570 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4774 SdHoareTripleChecker+Valid, 18087 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:02,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4774 Valid, 18087 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13407 states. [2025-01-09 05:24:02,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13407 to 13137. [2025-01-09 05:24:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13137 states, 12157 states have (on average 1.6805955416632392) internal successors, (20431), 12372 states have internal predecessors, (20431), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 05:24:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 22589 transitions. [2025-01-09 05:24:02,633 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 22589 transitions. Word has length 133 [2025-01-09 05:24:02,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:02,634 INFO L471 AbstractCegarLoop]: Abstraction has 13137 states and 22589 transitions. [2025-01-09 05:24:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 22589 transitions. [2025-01-09 05:24:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:24:02,644 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:02,644 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] [2025-01-09 05:24:02,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:24:02,644 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:02,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1690241901, now seen corresponding path program 1 times [2025-01-09 05:24:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:02,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727508038] [2025-01-09 05:24:02,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:02,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:24:02,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:24:02,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:02,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:02,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:02,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727508038] [2025-01-09 05:24:02,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727508038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:02,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:02,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:24:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848285384] [2025-01-09 05:24:02,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:24:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:02,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:24:02,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:24:02,769 INFO L87 Difference]: Start difference. First operand 13137 states and 22589 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:03,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:03,446 INFO L93 Difference]: Finished difference Result 27077 states and 47431 transitions. [2025-01-09 05:24:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:24:03,447 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:03,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:03,508 INFO L225 Difference]: With dead ends: 27077 [2025-01-09 05:24:03,509 INFO L226 Difference]: Without dead ends: 16077 [2025-01-09 05:24:03,544 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-01-09 05:24:03,545 INFO L435 NwaCegarLoop]: 4277 mSDtfsCounter, 4539 mSDsluCounter, 8435 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4555 SdHoareTripleChecker+Valid, 12712 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:03,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4555 Valid, 12712 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:24:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16077 states. [2025-01-09 05:24:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16077 to 13137. [2025-01-09 05:24:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13137 states, 12157 states have (on average 1.6778810561816238) internal successors, (20398), 12372 states have internal predecessors, (20398), 568 states have call successors, (568), 199 states have call predecessors, (568), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-01-09 05:24:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13137 states to 13137 states and 22556 transitions. [2025-01-09 05:24:04,101 INFO L78 Accepts]: Start accepts. Automaton has 13137 states and 22556 transitions. Word has length 133 [2025-01-09 05:24:04,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:04,102 INFO L471 AbstractCegarLoop]: Abstraction has 13137 states and 22556 transitions. [2025-01-09 05:24:04,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 13137 states and 22556 transitions. [2025-01-09 05:24:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:24:04,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:04,110 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] [2025-01-09 05:24:04,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:24:04,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:04,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:04,111 INFO L85 PathProgramCache]: Analyzing trace with hash -451618577, now seen corresponding path program 1 times [2025-01-09 05:24:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:04,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696997327] [2025-01-09 05:24:04,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:04,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:04,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:24:04,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:24:04,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:04,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:04,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696997327] [2025-01-09 05:24:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696997327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:04,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855944759] [2025-01-09 05:24:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:04,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:04,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:04,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:04,241 INFO L87 Difference]: Start difference. First operand 13137 states and 22556 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:05,822 INFO L93 Difference]: Finished difference Result 37915 states and 66653 transitions. [2025-01-09 05:24:05,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:05,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:05,934 INFO L225 Difference]: With dead ends: 37915 [2025-01-09 05:24:05,935 INFO L226 Difference]: Without dead ends: 26915 [2025-01-09 05:24:05,976 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-01-09 05:24:05,976 INFO L435 NwaCegarLoop]: 4509 mSDtfsCounter, 4745 mSDsluCounter, 13547 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4761 SdHoareTripleChecker+Valid, 18056 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:05,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4761 Valid, 18056 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26915 states. [2025-01-09 05:24:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26915 to 26507. [2025-01-09 05:24:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26507 states, 24337 states have (on average 1.6830340633603156) internal successors, (40960), 25006 states have internal predecessors, (40960), 1112 states have call successors, (1112), 391 states have call predecessors, (1112), 1056 states have return successors, (5206), 1173 states have call predecessors, (5206), 1110 states have call successors, (5206) [2025-01-09 05:24:07,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26507 states to 26507 states and 47278 transitions. [2025-01-09 05:24:07,094 INFO L78 Accepts]: Start accepts. Automaton has 26507 states and 47278 transitions. Word has length 133 [2025-01-09 05:24:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:07,095 INFO L471 AbstractCegarLoop]: Abstraction has 26507 states and 47278 transitions. [2025-01-09 05:24:07,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26507 states and 47278 transitions. [2025-01-09 05:24:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:24:07,105 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:07,105 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] [2025-01-09 05:24:07,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:24:07,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1074900179, now seen corresponding path program 1 times [2025-01-09 05:24:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168326675] [2025-01-09 05:24:07,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:07,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:24:07,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:24:07,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:07,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:07,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168326675] [2025-01-09 05:24:07,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168326675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:07,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:07,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:07,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134176288] [2025-01-09 05:24:07,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:07,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:07,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:07,209 INFO L87 Difference]: Start difference. First operand 26507 states and 47278 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:09,188 INFO L93 Difference]: Finished difference Result 86831 states and 161230 transitions. [2025-01-09 05:24:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:09,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:09,503 INFO L225 Difference]: With dead ends: 86831 [2025-01-09 05:24:09,503 INFO L226 Difference]: Without dead ends: 62461 [2025-01-09 05:24:09,594 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-01-09 05:24:09,594 INFO L435 NwaCegarLoop]: 4504 mSDtfsCounter, 4994 mSDsluCounter, 13527 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18031 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:09,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18031 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:24:09,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62461 states. [2025-01-09 05:24:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62461 to 57672. [2025-01-09 05:24:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57672 states, 52700 states have (on average 1.7020872865275143) internal successors, (89700), 54763 states have internal predecessors, (89700), 2136 states have call successors, (2136), 775 states have call predecessors, (2136), 2834 states have return successors, (18518), 2261 states have call predecessors, (18518), 2134 states have call successors, (18518) [2025-01-09 05:24:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57672 states to 57672 states and 110354 transitions. [2025-01-09 05:24:11,882 INFO L78 Accepts]: Start accepts. Automaton has 57672 states and 110354 transitions. Word has length 133 [2025-01-09 05:24:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:11,883 INFO L471 AbstractCegarLoop]: Abstraction has 57672 states and 110354 transitions. [2025-01-09 05:24:11,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 57672 states and 110354 transitions. [2025-01-09 05:24:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:24:11,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:11,907 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] [2025-01-09 05:24:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:24:11,907 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:11,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -956458705, now seen corresponding path program 1 times [2025-01-09 05:24:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500301063] [2025-01-09 05:24:11,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:11,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:24:11,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:24:11,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:11,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:12,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500301063] [2025-01-09 05:24:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500301063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63090003] [2025-01-09 05:24:12,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:12,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:12,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:12,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:12,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:12,057 INFO L87 Difference]: Start difference. First operand 57672 states and 110354 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:17,748 INFO L93 Difference]: Finished difference Result 196108 states and 400880 transitions. [2025-01-09 05:24:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:17,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:17,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:18,781 INFO L225 Difference]: With dead ends: 196108 [2025-01-09 05:24:18,781 INFO L226 Difference]: Without dead ends: 140573 [2025-01-09 05:24:18,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:24:18,989 INFO L435 NwaCegarLoop]: 4326 mSDtfsCounter, 4843 mSDsluCounter, 13092 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4858 SdHoareTripleChecker+Valid, 17418 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:18,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4858 Valid, 17418 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:24:19,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140573 states. [2025-01-09 05:24:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140573 to 131051. [2025-01-09 05:24:26,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131051 states, 119081 states have (on average 1.7233983591001083) internal successors, (205224), 125390 states have internal predecessors, (205224), 4120 states have call successors, (4120), 1543 states have call predecessors, (4120), 7848 states have return successors, (69654), 4373 states have call predecessors, (69654), 4118 states have call successors, (69654) [2025-01-09 05:24:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131051 states to 131051 states and 278998 transitions. [2025-01-09 05:24:27,487 INFO L78 Accepts]: Start accepts. Automaton has 131051 states and 278998 transitions. Word has length 133 [2025-01-09 05:24:27,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:24:27,492 INFO L471 AbstractCegarLoop]: Abstraction has 131051 states and 278998 transitions. [2025-01-09 05:24:27,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 131051 states and 278998 transitions. [2025-01-09 05:24:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 05:24:27,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:24:27,575 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] [2025-01-09 05:24:27,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:24:27,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:24:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:24:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash 432835309, now seen corresponding path program 1 times [2025-01-09 05:24:27,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:24:27,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235751434] [2025-01-09 05:24:27,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:24:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:24:27,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 05:24:27,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 05:24:27,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:24:27,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:24:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:24:27,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:24:27,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235751434] [2025-01-09 05:24:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235751434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:24:27,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:24:27,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:24:27,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052246998] [2025-01-09 05:24:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:24:27,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:24:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:24:27,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:24:27,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:24:27,697 INFO L87 Difference]: Start difference. First operand 131051 states and 278998 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:24:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:24:38,612 INFO L93 Difference]: Finished difference Result 455191 states and 1067262 transitions. [2025-01-09 05:24:38,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:24:38,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 133 [2025-01-09 05:24:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:24:40,861 INFO L225 Difference]: With dead ends: 455191 [2025-01-09 05:24:40,861 INFO L226 Difference]: Without dead ends: 326277 [2025-01-09 05:24:41,253 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-01-09 05:24:41,254 INFO L435 NwaCegarLoop]: 4498 mSDtfsCounter, 4924 mSDsluCounter, 13509 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4949 SdHoareTripleChecker+Valid, 18007 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:24:41,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4949 Valid, 18007 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:24:41,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326277 states. [2025-01-09 05:24:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326277 to 311382. [2025-01-09 05:24:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311382 states, 281170 states have (on average 1.7446811537504001) internal successors, (490552), 300345 states have internal predecessors, (490552), 7960 states have call successors, (7960), 3079 states have call predecessors, (7960), 22250 states have return successors, (270102), 8469 states have call predecessors, (270102), 7958 states have call successors, (270102)