./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.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_label42+token_ring.10.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 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:16:56,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:16:56,251 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:16:56,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:16:56,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:16:56,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:16:56,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:16:56,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:16:56,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:16:56,281 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:16:56,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:16:56,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:16:56,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:16:56,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:16:56,282 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:16:56,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:16:56,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:16:56,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:56,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:16:56,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:16:56,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:16:56,285 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:16:56,285 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 -> 02030f9c3db6d0a219b6d0b652f5c8999a9fbcf506b26b943850b37227141b78 [2025-01-09 05:16:56,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:16:56,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:16:56,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:16:56,529 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:16:56,530 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:16:56,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2025-01-09 05:16:57,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42981ae48/0b98d28fd48849f180036f962e4f7766/FLAGc30088b26 [2025-01-09 05:16:58,280 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:16:58,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label42+token_ring.10.cil-2.c [2025-01-09 05:16:58,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42981ae48/0b98d28fd48849f180036f962e4f7766/FLAGc30088b26 [2025-01-09 05:16:58,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/42981ae48/0b98d28fd48849f180036f962e4f7766 [2025-01-09 05:16:58,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:16:58,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:16:58,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:16:58,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:16:58,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:16:58,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:16:58" (1/1) ... [2025-01-09 05:16:58,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154be36a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:16:58, skipping insertion in model container [2025-01-09 05:16:58,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:16:58" (1/1) ... [2025-01-09 05:16:58,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:16:59,983 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_label42+token_ring.10.cil-2.c[378560,378573] [2025-01-09 05:17:00,011 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_label42+token_ring.10.cil-2.c[383339,383352] [2025-01-09 05:17:00,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:17:00,239 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:17:00,752 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_label42+token_ring.10.cil-2.c[378560,378573] [2025-01-09 05:17:00,767 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_label42+token_ring.10.cil-2.c[383339,383352] [2025-01-09 05:17:00,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:17:00,866 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:17:00,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00 WrapperNode [2025-01-09 05:17:00,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:17:00,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:17:00,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:17:00,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:17:00,885 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:17:00" (1/1) ... [2025-01-09 05:17:00,944 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:17:00" (1/1) ... [2025-01-09 05:17:01,287 INFO L138 Inliner]: procedures = 64, calls = 71, calls flagged for inlining = 42, calls inlined = 42, statements flattened = 13071 [2025-01-09 05:17:01,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:17:01,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:17:01,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:17:01,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:17:01,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,440 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:17:01,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:17:01,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:17:01,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:17:01,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:17:01,806 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (1/1) ... [2025-01-09 05:17:01,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:17:01,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:17:01,843 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:17:01,849 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:17:01,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:17:01,880 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:17:01,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:17:01,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:17:02,028 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:17:02,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:17:08,225 INFO L? ?]: Removed 1743 outVars from TransFormulas that were not future-live. [2025-01-09 05:17:08,225 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:17:08,266 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:17:08,267 INFO L312 CfgBuilder]: Removed 14 assume(true) statements. [2025-01-09 05:17:08,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:17:08 BoogieIcfgContainer [2025-01-09 05:17:08,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:17:08,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:17:08,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:17:08,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:17:08,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:16:58" (1/3) ... [2025-01-09 05:17:08,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bd4142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:17:08, skipping insertion in model container [2025-01-09 05:17:08,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:17:00" (2/3) ... [2025-01-09 05:17:08,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bd4142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:17:08, skipping insertion in model container [2025-01-09 05:17:08,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:17:08" (3/3) ... [2025-01-09 05:17:08,274 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label42+token_ring.10.cil-2.c [2025-01-09 05:17:08,285 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:17:08,289 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label42+token_ring.10.cil-2.c that has 7 procedures, 2513 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-01-09 05:17:08,383 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:17:08,394 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;@6315f5b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:17:08,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:17:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 2513 states, 2481 states have (on average 1.8399838774687627) internal successors, (4565), 2483 states have internal predecessors, (4565), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:17:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:08,420 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:08,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:08,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:08,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1739200000, now seen corresponding path program 1 times [2025-01-09 05:17:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:08,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076226434] [2025-01-09 05:17:08,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:08,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:08,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:08,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:08,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:08,793 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:17:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:08,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076226434] [2025-01-09 05:17:08,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076226434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:08,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:08,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:17:08,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927044386] [2025-01-09 05:17:08,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:17:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:08,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:17:08,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:17:08,819 INFO L87 Difference]: Start difference. First operand has 2513 states, 2481 states have (on average 1.8399838774687627) internal successors, (4565), 2483 states have internal predecessors, (4565), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:08,982 INFO L93 Difference]: Finished difference Result 5015 states and 9205 transitions. [2025-01-09 05:17:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:17:08,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:08,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:09,005 INFO L225 Difference]: With dead ends: 5015 [2025-01-09 05:17:09,005 INFO L226 Difference]: Without dead ends: 2446 [2025-01-09 05:17:09,015 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:17:09,018 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 504 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 8558 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:17:09,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 8558 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:17:09,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2025-01-09 05:17:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 2446. [2025-01-09 05:17:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2414 states have (on average 1.8309859154929577) internal successors, (4420), 2416 states have internal predecessors, (4420), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 05:17:09,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4468 transitions. [2025-01-09 05:17:09,134 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4468 transitions. Word has length 154 [2025-01-09 05:17:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:09,135 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4468 transitions. [2025-01-09 05:17:09,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4468 transitions. [2025-01-09 05:17:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:09,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:09,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:09,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:17:09,143 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:09,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2145156930, now seen corresponding path program 1 times [2025-01-09 05:17:09,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:09,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201578755] [2025-01-09 05:17:09,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:09,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:09,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:09,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:09,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:17:09,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:09,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201578755] [2025-01-09 05:17:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201578755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:09,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167544920] [2025-01-09 05:17:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:09,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:09,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:09,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:09,493 INFO L87 Difference]: Start difference. First operand 2446 states and 4468 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:10,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:10,248 INFO L93 Difference]: Finished difference Result 3124 states and 5561 transitions. [2025-01-09 05:17:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:10,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:10,260 INFO L225 Difference]: With dead ends: 3124 [2025-01-09 05:17:10,261 INFO L226 Difference]: Without dead ends: 2817 [2025-01-09 05:17:10,263 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:17:10,264 INFO L435 NwaCegarLoop]: 4626 mSDtfsCounter, 4942 mSDsluCounter, 14038 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4960 SdHoareTripleChecker+Valid, 18664 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:10,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4960 Valid, 18664 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:17:10,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2025-01-09 05:17:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2771. [2025-01-09 05:17:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2771 states, 2710 states have (on average 1.8055350553505536) internal successors, (4893), 2714 states have internal predecessors, (4893), 45 states have call successors, (45), 12 states have call predecessors, (45), 14 states have return successors, (52), 46 states have call predecessors, (52), 45 states have call successors, (52) [2025-01-09 05:17:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 4990 transitions. [2025-01-09 05:17:10,326 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 4990 transitions. Word has length 154 [2025-01-09 05:17:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:10,327 INFO L471 AbstractCegarLoop]: Abstraction has 2771 states and 4990 transitions. [2025-01-09 05:17:10,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 4990 transitions. [2025-01-09 05:17:10,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:10,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:10,329 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:10,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:17:10,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:10,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:10,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1860990976, now seen corresponding path program 1 times [2025-01-09 05:17:10,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:10,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589663679] [2025-01-09 05:17:10,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:10,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:10,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:10,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:10,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:10,552 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:17:10,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:10,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589663679] [2025-01-09 05:17:10,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589663679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:10,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:10,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:10,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937112817] [2025-01-09 05:17:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:10,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:10,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:10,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:10,553 INFO L87 Difference]: Start difference. First operand 2771 states and 4990 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:11,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:11,178 INFO L93 Difference]: Finished difference Result 4106 states and 7142 transitions. [2025-01-09 05:17:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:11,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:11,191 INFO L225 Difference]: With dead ends: 4106 [2025-01-09 05:17:11,192 INFO L226 Difference]: Without dead ends: 3476 [2025-01-09 05:17:11,194 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:17:11,195 INFO L435 NwaCegarLoop]: 4543 mSDtfsCounter, 4938 mSDsluCounter, 13828 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4956 SdHoareTripleChecker+Valid, 18371 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:11,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4956 Valid, 18371 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:17:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2025-01-09 05:17:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3411. [2025-01-09 05:17:11,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3411 states, 3296 states have (on average 1.7675970873786409) internal successors, (5826), 3304 states have internal predecessors, (5826), 83 states have call successors, (83), 24 states have call predecessors, (83), 30 states have return successors, (106), 86 states have call predecessors, (106), 83 states have call successors, (106) [2025-01-09 05:17:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 6015 transitions. [2025-01-09 05:17:11,346 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 6015 transitions. Word has length 154 [2025-01-09 05:17:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:11,346 INFO L471 AbstractCegarLoop]: Abstraction has 3411 states and 6015 transitions. [2025-01-09 05:17:11,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:11,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 6015 transitions. [2025-01-09 05:17:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:11,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:11,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:11,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:17:11,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1889103746, now seen corresponding path program 1 times [2025-01-09 05:17:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609353416] [2025-01-09 05:17:11,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:11,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:11,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:11,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:11,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:11,532 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:17:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609353416] [2025-01-09 05:17:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609353416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:11,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:11,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:11,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506579178] [2025-01-09 05:17:11,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:11,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:11,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:11,534 INFO L87 Difference]: Start difference. First operand 3411 states and 6015 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:12,272 INFO L93 Difference]: Finished difference Result 6179 states and 10529 transitions. [2025-01-09 05:17:12,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:12,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:12,295 INFO L225 Difference]: With dead ends: 6179 [2025-01-09 05:17:12,295 INFO L226 Difference]: Without dead ends: 4909 [2025-01-09 05:17:12,301 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:17:12,303 INFO L435 NwaCegarLoop]: 4618 mSDtfsCounter, 4932 mSDsluCounter, 14002 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4950 SdHoareTripleChecker+Valid, 18620 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:12,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4950 Valid, 18620 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:17:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4909 states. [2025-01-09 05:17:12,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4909 to 4807. [2025-01-09 05:17:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 4578 states have (on average 1.726518130187855) internal successors, (7904), 4600 states have internal predecessors, (7904), 159 states have call successors, (159), 48 states have call predecessors, (159), 68 states have return successors, (238), 166 states have call predecessors, (238), 159 states have call successors, (238) [2025-01-09 05:17:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 8301 transitions. [2025-01-09 05:17:12,478 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 8301 transitions. Word has length 154 [2025-01-09 05:17:12,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:12,478 INFO L471 AbstractCegarLoop]: Abstraction has 4807 states and 8301 transitions. [2025-01-09 05:17:12,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:12,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 8301 transitions. [2025-01-09 05:17:12,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:12,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:12,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:12,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:17:12,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:12,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:12,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1730703424, now seen corresponding path program 1 times [2025-01-09 05:17:12,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:12,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189268581] [2025-01-09 05:17:12,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:12,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:12,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:12,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:12,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:12,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:12,644 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:17:12,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:12,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189268581] [2025-01-09 05:17:12,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189268581] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:12,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:12,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378611082] [2025-01-09 05:17:12,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:12,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:12,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:12,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:12,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:12,646 INFO L87 Difference]: Start difference. First operand 4807 states and 8301 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:13,446 INFO L93 Difference]: Finished difference Result 10770 states and 18235 transitions. [2025-01-09 05:17:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:13,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:13,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:13,481 INFO L225 Difference]: With dead ends: 10770 [2025-01-09 05:17:13,481 INFO L226 Difference]: Without dead ends: 8104 [2025-01-09 05:17:13,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:17:13,493 INFO L435 NwaCegarLoop]: 4615 mSDtfsCounter, 4927 mSDsluCounter, 13989 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4945 SdHoareTripleChecker+Valid, 18604 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:13,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4945 Valid, 18604 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:17:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2025-01-09 05:17:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 7931. [2025-01-09 05:17:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7931 states, 7456 states have (on average 1.698766094420601) internal successors, (12666), 7524 states have internal predecessors, (12666), 311 states have call successors, (311), 96 states have call predecessors, (311), 162 states have return successors, (598), 326 states have call predecessors, (598), 311 states have call successors, (598) [2025-01-09 05:17:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7931 states to 7931 states and 13575 transitions. [2025-01-09 05:17:13,689 INFO L78 Accepts]: Start accepts. Automaton has 7931 states and 13575 transitions. Word has length 154 [2025-01-09 05:17:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:13,690 INFO L471 AbstractCegarLoop]: Abstraction has 7931 states and 13575 transitions. [2025-01-09 05:17:13,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 7931 states and 13575 transitions. [2025-01-09 05:17:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:13,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:13,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:13,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:17:13,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:13,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:13,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1616211906, now seen corresponding path program 1 times [2025-01-09 05:17:13,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:13,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662389997] [2025-01-09 05:17:13,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:13,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:13,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:13,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:13,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:13,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:13,817 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:17:13,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:13,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662389997] [2025-01-09 05:17:13,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662389997] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:13,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:13,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:13,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274939913] [2025-01-09 05:17:13,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:13,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:13,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:13,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:13,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:13,818 INFO L87 Difference]: Start difference. First operand 7931 states and 13575 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:14,631 INFO L93 Difference]: Finished difference Result 21221 states and 36437 transitions. [2025-01-09 05:17:14,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:14,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:14,696 INFO L225 Difference]: With dead ends: 21221 [2025-01-09 05:17:14,697 INFO L226 Difference]: Without dead ends: 15431 [2025-01-09 05:17:14,721 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:17:14,722 INFO L435 NwaCegarLoop]: 4613 mSDtfsCounter, 4922 mSDsluCounter, 13977 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4940 SdHoareTripleChecker+Valid, 18590 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:14,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4940 Valid, 18590 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:17:14,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15431 states. [2025-01-09 05:17:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15431 to 15123. [2025-01-09 05:17:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15123 states, 14102 states have (on average 1.6953623599489434) internal successors, (23908), 14316 states have internal predecessors, (23908), 615 states have call successors, (615), 192 states have call predecessors, (615), 404 states have return successors, (1702), 646 states have call predecessors, (1702), 615 states have call successors, (1702) [2025-01-09 05:17:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15123 states to 15123 states and 26225 transitions. [2025-01-09 05:17:15,135 INFO L78 Accepts]: Start accepts. Automaton has 15123 states and 26225 transitions. Word has length 154 [2025-01-09 05:17:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:15,135 INFO L471 AbstractCegarLoop]: Abstraction has 15123 states and 26225 transitions. [2025-01-09 05:17:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 15123 states and 26225 transitions. [2025-01-09 05:17:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:15,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:15,143 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:15,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:17:15,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:15,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1031440256, now seen corresponding path program 1 times [2025-01-09 05:17:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:15,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450153097] [2025-01-09 05:17:15,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:15,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:15,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:15,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:15,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:15,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:15,256 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:17:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:15,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450153097] [2025-01-09 05:17:15,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450153097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:15,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535594427] [2025-01-09 05:17:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:15,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:15,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:15,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:15,257 INFO L87 Difference]: Start difference. First operand 15123 states and 26225 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:16,229 INFO L93 Difference]: Finished difference Result 45724 states and 81291 transitions. [2025-01-09 05:17:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:16,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:16,352 INFO L225 Difference]: With dead ends: 45724 [2025-01-09 05:17:16,352 INFO L226 Difference]: Without dead ends: 32742 [2025-01-09 05:17:16,402 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:17:16,403 INFO L435 NwaCegarLoop]: 4611 mSDtfsCounter, 4917 mSDsluCounter, 13965 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 18576 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:16,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 18576 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:17:16,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32742 states. [2025-01-09 05:17:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32742 to 32179. [2025-01-09 05:17:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32179 states, 29904 states have (on average 1.713282504012841) internal successors, (51234), 30572 states have internal predecessors, (51234), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 1050 states have return successors, (5446), 1286 states have call predecessors, (5446), 1223 states have call successors, (5446) [2025-01-09 05:17:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32179 states to 32179 states and 57903 transitions. [2025-01-09 05:17:17,441 INFO L78 Accepts]: Start accepts. Automaton has 32179 states and 57903 transitions. Word has length 154 [2025-01-09 05:17:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:17,442 INFO L471 AbstractCegarLoop]: Abstraction has 32179 states and 57903 transitions. [2025-01-09 05:17:17,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 32179 states and 57903 transitions. [2025-01-09 05:17:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:17,457 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:17,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:17:17,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:17,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:17,458 INFO L85 PathProgramCache]: Analyzing trace with hash 596934658, now seen corresponding path program 1 times [2025-01-09 05:17:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455767229] [2025-01-09 05:17:17,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:17,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:17,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:17,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:17,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:17,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:17,643 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:17:17,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:17,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455767229] [2025-01-09 05:17:17,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455767229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:17,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:17,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:17:17,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560375149] [2025-01-09 05:17:17,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:17,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:17:17,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:17,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:17:17,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:17:17,644 INFO L87 Difference]: Start difference. First operand 32179 states and 57903 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:18,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:18,912 INFO L93 Difference]: Finished difference Result 73883 states and 137312 transitions. [2025-01-09 05:17:18,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:17:18,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:19,077 INFO L225 Difference]: With dead ends: 73883 [2025-01-09 05:17:19,077 INFO L226 Difference]: Without dead ends: 43843 [2025-01-09 05:17:19,170 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:17:19,170 INFO L435 NwaCegarLoop]: 4330 mSDtfsCounter, 4644 mSDsluCounter, 8525 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4662 SdHoareTripleChecker+Valid, 12855 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:19,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4662 Valid, 12855 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:17:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43843 states. [2025-01-09 05:17:20,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43843 to 32179. [2025-01-09 05:17:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32179 states, 29904 states have (on average 1.7111088817549491) internal successors, (51169), 30572 states have internal predecessors, (51169), 1223 states have call successors, (1223), 384 states have call predecessors, (1223), 1050 states have return successors, (5446), 1286 states have call predecessors, (5446), 1223 states have call successors, (5446) [2025-01-09 05:17:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32179 states to 32179 states and 57838 transitions. [2025-01-09 05:17:20,700 INFO L78 Accepts]: Start accepts. Automaton has 32179 states and 57838 transitions. Word has length 154 [2025-01-09 05:17:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:20,701 INFO L471 AbstractCegarLoop]: Abstraction has 32179 states and 57838 transitions. [2025-01-09 05:17:20,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 32179 states and 57838 transitions. [2025-01-09 05:17:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:20,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:20,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:17:20,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 167276352, now seen corresponding path program 1 times [2025-01-09 05:17:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552700839] [2025-01-09 05:17:20,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:20,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:20,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:20,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:20,854 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:17:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:20,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552700839] [2025-01-09 05:17:20,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552700839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:20,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:20,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:20,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586446173] [2025-01-09 05:17:20,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:20,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:20,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:20,856 INFO L87 Difference]: Start difference. First operand 32179 states and 57838 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:22,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:22,613 INFO L93 Difference]: Finished difference Result 103317 states and 193667 transitions. [2025-01-09 05:17:22,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:22,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:22,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:22,925 INFO L225 Difference]: With dead ends: 103317 [2025-01-09 05:17:22,925 INFO L226 Difference]: Without dead ends: 73279 [2025-01-09 05:17:23,021 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:17:23,021 INFO L435 NwaCegarLoop]: 4600 mSDtfsCounter, 4901 mSDsluCounter, 13920 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4919 SdHoareTripleChecker+Valid, 18520 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:23,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4919 Valid, 18520 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:17:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73279 states. [2025-01-09 05:17:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73279 to 72367. [2025-01-09 05:17:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72367 states, 67098 states have (on average 1.7350591671882918) internal successors, (116419), 69160 states have internal predecessors, (116419), 2439 states have call successors, (2439), 768 states have call predecessors, (2439), 2828 states have return successors, (19078), 2566 states have call predecessors, (19078), 2439 states have call successors, (19078) [2025-01-09 05:17:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72367 states to 72367 states and 137936 transitions. [2025-01-09 05:17:26,623 INFO L78 Accepts]: Start accepts. Automaton has 72367 states and 137936 transitions. Word has length 154 [2025-01-09 05:17:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:17:26,624 INFO L471 AbstractCegarLoop]: Abstraction has 72367 states and 137936 transitions. [2025-01-09 05:17:26,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 72367 states and 137936 transitions. [2025-01-09 05:17:26,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 05:17:26,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:17:26,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:17:26,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:17:26,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:17:26,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:17:26,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1114314238, now seen corresponding path program 1 times [2025-01-09 05:17:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:17:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636089098] [2025-01-09 05:17:26,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:17:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:17:26,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 05:17:26,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 05:17:26,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:17:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:17:26,793 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:17:26,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:17:26,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636089098] [2025-01-09 05:17:26,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636089098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:17:26,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:17:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:17:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357049830] [2025-01-09 05:17:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:17:26,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:17:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:17:26,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:17:26,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:17:26,795 INFO L87 Difference]: Start difference. First operand 72367 states and 137936 transitions. Second operand has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:17:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:17:31,032 INFO L93 Difference]: Finished difference Result 242868 states and 492137 transitions. [2025-01-09 05:17:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:17:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 5 states have internal predecessors, (144), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 154 [2025-01-09 05:17:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:17:31,881 INFO L225 Difference]: With dead ends: 242868 [2025-01-09 05:17:31,881 INFO L226 Difference]: Without dead ends: 172642 [2025-01-09 05:17:32,270 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:17:32,271 INFO L435 NwaCegarLoop]: 4536 mSDtfsCounter, 4897 mSDsluCounter, 13769 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4915 SdHoareTripleChecker+Valid, 18305 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:17:32,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4915 Valid, 18305 Invalid, 946 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [36 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:17:32,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172642 states.