./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.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_label49+token_ring.11.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:28:04,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:28:04,369 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:28:04,376 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:28:04,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:28:04,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:28:04,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:28:04,400 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:28:04,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:28:04,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:28:04,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:28:04,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:28:04,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:28:04,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:28:04,402 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:28:04,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:28:04,402 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:28:04,403 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:28:04,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:28:04,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:28:04,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:28:04,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:28:04,404 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 -> baa3d7d596cfacd752b448b2d94171196ab29c96dae98d968ce044a2cc25c48f [2025-01-09 05:28:04,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:28:04,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:28:04,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:28:04,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:28:04,599 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:28:04,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.c [2025-01-09 05:28:05,751 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f82b2ae4c/d64e4a1f2aa541909cac27fd570ce0e1/FLAGd0076467f [2025-01-09 05:28:06,540 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:28:06,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.11.cil-1.c [2025-01-09 05:28:06,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f82b2ae4c/d64e4a1f2aa541909cac27fd570ce0e1/FLAGd0076467f [2025-01-09 05:28:06,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f82b2ae4c/d64e4a1f2aa541909cac27fd570ce0e1 [2025-01-09 05:28:06,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:28:06,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:28:06,611 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:28:06,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:28:06,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:28:06,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:28:06" (1/1) ... [2025-01-09 05:28:06,616 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20278eac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:06, skipping insertion in model container [2025-01-09 05:28:06,616 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:28:06" (1/1) ... [2025-01-09 05:28:06,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:28:07,952 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_label49+token_ring.11.cil-1.c[380593,380606] [2025-01-09 05:28:07,979 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_label49+token_ring.11.cil-1.c[383339,383352] [2025-01-09 05:28:08,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:28:08,223 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:28:08,746 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_label49+token_ring.11.cil-1.c[380593,380606] [2025-01-09 05:28:08,751 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_label49+token_ring.11.cil-1.c[383339,383352] [2025-01-09 05:28:08,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:28:08,820 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:28:08,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08 WrapperNode [2025-01-09 05:28:08,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:28:08,823 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:28:08,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:28:08,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:28:08,828 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:28:08" (1/1) ... [2025-01-09 05:28:08,879 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:28:08" (1/1) ... [2025-01-09 05:28:09,148 INFO L138 Inliner]: procedures = 66, calls = 75, calls flagged for inlining = 43, calls inlined = 43, statements flattened = 13134 [2025-01-09 05:28:09,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:28:09,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:28:09,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:28:09,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:28:09,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,350 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:28:09,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:28:09,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:28:09,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:28:09,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:28:09,683 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (1/1) ... [2025-01-09 05:28:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:28:09,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:28:09,710 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:28:09,713 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:28:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:28:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:28:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:28:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:28:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:28:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:28:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:28:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:28:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:28:09,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:28:09,729 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:28:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:28:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:28:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:28:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:28:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:28:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:28:09,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:28:09,819 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:28:09,821 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:28:16,357 INFO L? ?]: Removed 1753 outVars from TransFormulas that were not future-live. [2025-01-09 05:28:16,358 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:28:16,402 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:28:16,402 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 05:28:16,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:28:16 BoogieIcfgContainer [2025-01-09 05:28:16,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:28:16,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:28:16,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:28:16,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:28:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:28:06" (1/3) ... [2025-01-09 05:28:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3d38c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:28:16, skipping insertion in model container [2025-01-09 05:28:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:28:08" (2/3) ... [2025-01-09 05:28:16,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c3d38c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:28:16, skipping insertion in model container [2025-01-09 05:28:16,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:28:16" (3/3) ... [2025-01-09 05:28:16,410 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.11.cil-1.c [2025-01-09 05:28:16,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:28:16,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.11.cil-1.c that has 8 procedures, 2546 locations, 1 initial locations, 15 loop locations, and 2 error locations. [2025-01-09 05:28:16,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:28:16,512 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;@625adf65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:28:16,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:28:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 2546 states, 2510 states have (on average 1.8386454183266931) internal successors, (4615), 2514 states have internal predecessors, (4615), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 05:28:16,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:16,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:16,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:16,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash -81239662, now seen corresponding path program 1 times [2025-01-09 05:28:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:16,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151120954] [2025-01-09 05:28:16,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:16,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:16,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:16,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:16,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:16,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:16,790 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:28:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151120954] [2025-01-09 05:28:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151120954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:16,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:28:16,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530819232] [2025-01-09 05:28:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:16,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:28:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:16,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:28:16,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:28:16,824 INFO L87 Difference]: Start difference. First operand has 2546 states, 2510 states have (on average 1.8386454183266931) internal successors, (4615), 2514 states have internal predecessors, (4615), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:17,030 INFO L93 Difference]: Finished difference Result 5086 states and 9329 transitions. [2025-01-09 05:28:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:28:17,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:17,051 INFO L225 Difference]: With dead ends: 5086 [2025-01-09 05:28:17,052 INFO L226 Difference]: Without dead ends: 2478 [2025-01-09 05:28:17,058 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:28:17,060 INFO L435 NwaCegarLoop]: 4589 mSDtfsCounter, 563 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 8611 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:28:17,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 8611 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:28:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2025-01-09 05:28:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2025-01-09 05:28:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2443 states have (on average 1.8293082275890298) internal successors, (4469), 2446 states have internal predecessors, (4469), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:28:17,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 4521 transitions. [2025-01-09 05:28:17,259 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 4521 transitions. Word has length 166 [2025-01-09 05:28:17,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:17,260 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 4521 transitions. [2025-01-09 05:28:17,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:17,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 4521 transitions. [2025-01-09 05:28:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:17,263 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:17,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:17,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:28:17,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:17,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2113989204, now seen corresponding path program 1 times [2025-01-09 05:28:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491424378] [2025-01-09 05:28:17,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:17,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:17,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:17,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:17,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:17,438 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:28:17,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:17,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491424378] [2025-01-09 05:28:17,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491424378] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:17,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:17,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:28:17,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553355975] [2025-01-09 05:28:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:17,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:28:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:17,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:28:17,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:28:17,441 INFO L87 Difference]: Start difference. First operand 2478 states and 4521 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:17,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:17,501 INFO L93 Difference]: Finished difference Result 2821 states and 5061 transitions. [2025-01-09 05:28:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:28:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:17,511 INFO L225 Difference]: With dead ends: 2821 [2025-01-09 05:28:17,511 INFO L226 Difference]: Without dead ends: 2478 [2025-01-09 05:28:17,513 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:28:17,514 INFO L435 NwaCegarLoop]: 4519 mSDtfsCounter, 549 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 8477 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:28:17,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 8477 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:28:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2025-01-09 05:28:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2025-01-09 05:28:17,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2443 states have (on average 1.8288988948014735) internal successors, (4468), 2446 states have internal predecessors, (4468), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-09 05:28:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 4520 transitions. [2025-01-09 05:28:17,563 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 4520 transitions. Word has length 166 [2025-01-09 05:28:17,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:17,564 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 4520 transitions. [2025-01-09 05:28:17,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 4520 transitions. [2025-01-09 05:28:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:17,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:17,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:28:17,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:17,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1257810666, now seen corresponding path program 1 times [2025-01-09 05:28:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362685565] [2025-01-09 05:28:17,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:17,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:17,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:17,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:17,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:17,844 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:28:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362685565] [2025-01-09 05:28:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362685565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:28:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003982483] [2025-01-09 05:28:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:28:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:17,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:28:17,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:28:17,846 INFO L87 Difference]: Start difference. First operand 2478 states and 4520 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:18,437 INFO L93 Difference]: Finished difference Result 3198 states and 5672 transitions. [2025-01-09 05:28:18,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:28:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:18,449 INFO L225 Difference]: With dead ends: 3198 [2025-01-09 05:28:18,449 INFO L226 Difference]: Without dead ends: 2860 [2025-01-09 05:28:18,451 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:28:18,454 INFO L435 NwaCegarLoop]: 4395 mSDtfsCounter, 5034 mSDsluCounter, 9031 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5053 SdHoareTripleChecker+Valid, 13426 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:18,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5053 Valid, 13426 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:28:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2025-01-09 05:28:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2831. [2025-01-09 05:28:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2769 states have (on average 1.802455760202239) internal successors, (4991), 2773 states have internal predecessors, (4991), 47 states have call successors, (47), 13 states have call predecessors, (47), 13 states have return successors, (46), 45 states have call predecessors, (46), 45 states have call successors, (46) [2025-01-09 05:28:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 5084 transitions. [2025-01-09 05:28:18,518 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 5084 transitions. Word has length 166 [2025-01-09 05:28:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:18,519 INFO L471 AbstractCegarLoop]: Abstraction has 2831 states and 5084 transitions. [2025-01-09 05:28:18,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 4 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 5084 transitions. [2025-01-09 05:28:18,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:18,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:18,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:18,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:28:18,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:18,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash -671376622, now seen corresponding path program 1 times [2025-01-09 05:28:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:18,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256689181] [2025-01-09 05:28:18,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:18,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:18,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:18,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:18,730 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:28:18,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:18,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256689181] [2025-01-09 05:28:18,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256689181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:18,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:18,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:18,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109445333] [2025-01-09 05:28:18,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:18,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:18,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:18,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:18,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:18,731 INFO L87 Difference]: Start difference. First operand 2831 states and 5084 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:19,497 INFO L93 Difference]: Finished difference Result 3975 states and 6933 transitions. [2025-01-09 05:28:19,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:19,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:19,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:19,512 INFO L225 Difference]: With dead ends: 3975 [2025-01-09 05:28:19,512 INFO L226 Difference]: Without dead ends: 3284 [2025-01-09 05:28:19,515 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:28:19,516 INFO L435 NwaCegarLoop]: 4698 mSDtfsCounter, 5041 mSDsluCounter, 14138 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5060 SdHoareTripleChecker+Valid, 18836 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:19,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5060 Valid, 18836 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:28:19,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2025-01-09 05:28:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3159. [2025-01-09 05:28:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3159 states, 3070 states have (on average 1.7798045602605863) internal successors, (5464), 3075 states have internal predecessors, (5464), 67 states have call successors, (67), 19 states have call predecessors, (67), 20 states have return successors, (69), 66 states have call predecessors, (69), 65 states have call successors, (69) [2025-01-09 05:28:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 5600 transitions. [2025-01-09 05:28:19,668 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 5600 transitions. Word has length 166 [2025-01-09 05:28:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:19,668 INFO L471 AbstractCegarLoop]: Abstraction has 3159 states and 5600 transitions. [2025-01-09 05:28:19,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 5600 transitions. [2025-01-09 05:28:19,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:19,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:19,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:19,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:28:19,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:19,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash -244822124, now seen corresponding path program 1 times [2025-01-09 05:28:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:19,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574264179] [2025-01-09 05:28:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:19,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:19,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:19,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:19,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:19,831 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:28:19,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574264179] [2025-01-09 05:28:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574264179] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:19,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:19,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037576366] [2025-01-09 05:28:19,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:19,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:19,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:19,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:19,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:19,833 INFO L87 Difference]: Start difference. First operand 3159 states and 5600 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:20,601 INFO L93 Difference]: Finished difference Result 5023 states and 8608 transitions. [2025-01-09 05:28:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:20,617 INFO L225 Difference]: With dead ends: 5023 [2025-01-09 05:28:20,617 INFO L226 Difference]: Without dead ends: 4004 [2025-01-09 05:28:20,622 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:28:20,623 INFO L435 NwaCegarLoop]: 4694 mSDtfsCounter, 5036 mSDsluCounter, 14126 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5055 SdHoareTripleChecker+Valid, 18820 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:20,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5055 Valid, 18820 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:28:20,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4004 states. [2025-01-09 05:28:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4004 to 3860. [2025-01-09 05:28:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3860 states, 3715 states have (on average 1.747779273216689) internal successors, (6493), 3724 states have internal predecessors, (6493), 107 states have call successors, (107), 31 states have call predecessors, (107), 36 states have return successors, (121), 108 states have call predecessors, (121), 105 states have call successors, (121) [2025-01-09 05:28:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3860 states to 3860 states and 6721 transitions. [2025-01-09 05:28:20,771 INFO L78 Accepts]: Start accepts. Automaton has 3860 states and 6721 transitions. Word has length 166 [2025-01-09 05:28:20,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:20,771 INFO L471 AbstractCegarLoop]: Abstraction has 3860 states and 6721 transitions. [2025-01-09 05:28:20,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3860 states and 6721 transitions. [2025-01-09 05:28:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:20,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:20,774 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:20,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:28:20,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:20,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:20,775 INFO L85 PathProgramCache]: Analyzing trace with hash -785251630, now seen corresponding path program 1 times [2025-01-09 05:28:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184898508] [2025-01-09 05:28:20,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:20,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:20,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:20,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:20,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:20,945 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:28:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184898508] [2025-01-09 05:28:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184898508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320126070] [2025-01-09 05:28:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:20,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:20,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:20,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:20,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:20,947 INFO L87 Difference]: Start difference. First operand 3860 states and 6721 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:21,771 INFO L93 Difference]: Finished difference Result 7294 states and 12311 transitions. [2025-01-09 05:28:21,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:21,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:21,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:21,801 INFO L225 Difference]: With dead ends: 7294 [2025-01-09 05:28:21,801 INFO L226 Difference]: Without dead ends: 5574 [2025-01-09 05:28:21,810 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:28:21,811 INFO L435 NwaCegarLoop]: 4691 mSDtfsCounter, 5031 mSDsluCounter, 14117 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5050 SdHoareTripleChecker+Valid, 18808 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:21,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5050 Valid, 18808 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:28:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states. [2025-01-09 05:28:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 5391. [2025-01-09 05:28:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5391 states, 5128 states have (on average 1.7139235569422777) internal successors, (8789), 5151 states have internal predecessors, (8789), 187 states have call successors, (187), 55 states have call predecessors, (187), 74 states have return successors, (249), 192 states have call predecessors, (249), 185 states have call successors, (249) [2025-01-09 05:28:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5391 states to 5391 states and 9225 transitions. [2025-01-09 05:28:22,020 INFO L78 Accepts]: Start accepts. Automaton has 5391 states and 9225 transitions. Word has length 166 [2025-01-09 05:28:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:22,020 INFO L471 AbstractCegarLoop]: Abstraction has 5391 states and 9225 transitions. [2025-01-09 05:28:22,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:22,021 INFO L276 IsEmpty]: Start isEmpty. Operand 5391 states and 9225 transitions. [2025-01-09 05:28:22,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:22,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:22,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:22,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:28:22,024 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:22,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -941232172, now seen corresponding path program 1 times [2025-01-09 05:28:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:22,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967314649] [2025-01-09 05:28:22,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:22,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:22,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:22,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:22,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:22,208 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:28:22,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:22,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967314649] [2025-01-09 05:28:22,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967314649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:22,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:22,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:22,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555765377] [2025-01-09 05:28:22,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:22,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:22,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:22,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:22,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:22,212 INFO L87 Difference]: Start difference. First operand 5391 states and 9225 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:23,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:23,004 INFO L93 Difference]: Finished difference Result 12333 states and 20753 transitions. [2025-01-09 05:28:23,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:23,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:23,037 INFO L225 Difference]: With dead ends: 12333 [2025-01-09 05:28:23,037 INFO L226 Difference]: Without dead ends: 9082 [2025-01-09 05:28:23,051 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:28:23,052 INFO L435 NwaCegarLoop]: 4688 mSDtfsCounter, 5026 mSDsluCounter, 14108 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5045 SdHoareTripleChecker+Valid, 18796 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:23,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5045 Valid, 18796 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:28:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2025-01-09 05:28:23,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 8822. [2025-01-09 05:28:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8822 states, 8305 states have (on average 1.6930764599638772) internal successors, (14061), 8374 states have internal predecessors, (14061), 347 states have call successors, (347), 103 states have call predecessors, (347), 168 states have return successors, (601), 360 states have call predecessors, (601), 345 states have call successors, (601) [2025-01-09 05:28:23,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8822 states to 8822 states and 15009 transitions. [2025-01-09 05:28:23,386 INFO L78 Accepts]: Start accepts. Automaton has 8822 states and 15009 transitions. Word has length 166 [2025-01-09 05:28:23,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:23,386 INFO L471 AbstractCegarLoop]: Abstraction has 8822 states and 15009 transitions. [2025-01-09 05:28:23,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 8822 states and 15009 transitions. [2025-01-09 05:28:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:23,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:23,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:23,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:28:23,392 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:23,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:23,392 INFO L85 PathProgramCache]: Analyzing trace with hash -530621806, now seen corresponding path program 1 times [2025-01-09 05:28:23,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:23,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883275022] [2025-01-09 05:28:23,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:23,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:23,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:23,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:23,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:23,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:23,513 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:28:23,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:23,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883275022] [2025-01-09 05:28:23,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883275022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:23,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:23,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:23,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956600619] [2025-01-09 05:28:23,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:23,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:23,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:23,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:23,515 INFO L87 Difference]: Start difference. First operand 8822 states and 15009 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:24,325 INFO L93 Difference]: Finished difference Result 23828 states and 40723 transitions. [2025-01-09 05:28:24,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:24,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:24,384 INFO L225 Difference]: With dead ends: 23828 [2025-01-09 05:28:24,384 INFO L226 Difference]: Without dead ends: 17146 [2025-01-09 05:28:24,424 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:28:24,425 INFO L435 NwaCegarLoop]: 4685 mSDtfsCounter, 5021 mSDsluCounter, 14099 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5040 SdHoareTripleChecker+Valid, 18784 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:24,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5040 Valid, 18784 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:28:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17146 states. [2025-01-09 05:28:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17146 to 16737. [2025-01-09 05:28:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16737 states, 15658 states have (on average 1.6950440669306426) internal successors, (26541), 15873 states have internal predecessors, (26541), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-01-09 05:28:24,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16737 states to 16737 states and 28897 transitions. [2025-01-09 05:28:24,931 INFO L78 Accepts]: Start accepts. Automaton has 16737 states and 28897 transitions. Word has length 166 [2025-01-09 05:28:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:24,931 INFO L471 AbstractCegarLoop]: Abstraction has 16737 states and 28897 transitions. [2025-01-09 05:28:24,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 16737 states and 28897 transitions. [2025-01-09 05:28:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:24,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:24,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:24,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:28:24,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:24,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1976475668, now seen corresponding path program 1 times [2025-01-09 05:28:24,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:24,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368464047] [2025-01-09 05:28:24,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:24,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:24,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:24,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:24,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:25,068 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:28:25,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:25,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368464047] [2025-01-09 05:28:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368464047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:25,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:25,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:28:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320986512] [2025-01-09 05:28:25,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:25,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:28:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:25,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:28:25,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:28:25,074 INFO L87 Difference]: Start difference. First operand 16737 states and 28897 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:25,630 INFO L93 Difference]: Finished difference Result 35744 states and 62982 transitions. [2025-01-09 05:28:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:28:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:25,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:25,706 INFO L225 Difference]: With dead ends: 35744 [2025-01-09 05:28:25,706 INFO L226 Difference]: Without dead ends: 21147 [2025-01-09 05:28:25,753 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:28:25,754 INFO L435 NwaCegarLoop]: 4372 mSDtfsCounter, 4715 mSDsluCounter, 8595 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4734 SdHoareTripleChecker+Valid, 12967 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:25,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4734 Valid, 12967 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:28:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21147 states. [2025-01-09 05:28:26,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21147 to 16737. [2025-01-09 05:28:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16737 states, 15658 states have (on average 1.692936518073828) internal successors, (26508), 15873 states have internal predecessors, (26508), 667 states have call successors, (667), 199 states have call predecessors, (667), 410 states have return successors, (1689), 696 states have call predecessors, (1689), 665 states have call successors, (1689) [2025-01-09 05:28:26,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16737 states to 16737 states and 28864 transitions. [2025-01-09 05:28:26,335 INFO L78 Accepts]: Start accepts. Automaton has 16737 states and 28864 transitions. Word has length 166 [2025-01-09 05:28:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 16737 states and 28864 transitions. [2025-01-09 05:28:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 16737 states and 28864 transitions. [2025-01-09 05:28:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:26,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:26,343 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:26,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:28:26,343 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:26,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash 2046123542, now seen corresponding path program 1 times [2025-01-09 05:28:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:26,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320020846] [2025-01-09 05:28:26,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:26,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:26,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:26,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:26,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:26,479 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:28:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:26,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320020846] [2025-01-09 05:28:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320020846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:26,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391106726] [2025-01-09 05:28:26,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:26,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:26,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:26,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:26,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:26,481 INFO L87 Difference]: Start difference. First operand 16737 states and 28864 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:27,876 INFO L93 Difference]: Finished difference Result 50299 states and 88774 transitions. [2025-01-09 05:28:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:28,005 INFO L225 Difference]: With dead ends: 50299 [2025-01-09 05:28:28,006 INFO L226 Difference]: Without dead ends: 35702 [2025-01-09 05:28:28,051 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:28:28,052 INFO L435 NwaCegarLoop]: 4673 mSDtfsCounter, 5005 mSDsluCounter, 14066 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5024 SdHoareTripleChecker+Valid, 18739 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:28,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5024 Valid, 18739 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 05:28:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35702 states. [2025-01-09 05:28:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35702 to 35078. [2025-01-09 05:28:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35078 states, 32713 states have (on average 1.710512640234769) internal successors, (55956), 33382 states have internal predecessors, (55956), 1307 states have call successors, (1307), 391 states have call predecessors, (1307), 1056 states have return successors, (5401), 1368 states have call predecessors, (5401), 1305 states have call successors, (5401) [2025-01-09 05:28:29,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35078 states to 35078 states and 62664 transitions. [2025-01-09 05:28:29,289 INFO L78 Accepts]: Start accepts. Automaton has 35078 states and 62664 transitions. Word has length 166 [2025-01-09 05:28:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:29,289 INFO L471 AbstractCegarLoop]: Abstraction has 35078 states and 62664 transitions. [2025-01-09 05:28:29,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:29,290 INFO L276 IsEmpty]: Start isEmpty. Operand 35078 states and 62664 transitions. [2025-01-09 05:28:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:29,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:29,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:29,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:28:29,303 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1830955052, now seen corresponding path program 1 times [2025-01-09 05:28:29,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:29,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300004858] [2025-01-09 05:28:29,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:29,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:29,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:29,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:29,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:29,418 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:28:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300004858] [2025-01-09 05:28:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300004858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:29,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478921970] [2025-01-09 05:28:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:29,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:29,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:29,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:29,421 INFO L87 Difference]: Start difference. First operand 35078 states and 62664 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:31,398 INFO L93 Difference]: Finished difference Result 113332 states and 210848 transitions. [2025-01-09 05:28:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:31,845 INFO L225 Difference]: With dead ends: 113332 [2025-01-09 05:28:31,845 INFO L226 Difference]: Without dead ends: 80394 [2025-01-09 05:28:31,938 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:28:31,940 INFO L435 NwaCegarLoop]: 4670 mSDtfsCounter, 5000 mSDsluCounter, 14057 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18727 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:31,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18727 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 05:28:31,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80394 states. [2025-01-09 05:28:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80394 to 79293. [2025-01-09 05:28:34,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79293 states, 73870 states have (on average 1.7385677541627182) internal successors, (128428), 75933 states have internal predecessors, (128428), 2587 states have call successors, (2587), 775 states have call predecessors, (2587), 2834 states have return successors, (18969), 2712 states have call predecessors, (18969), 2585 states have call successors, (18969) [2025-01-09 05:28:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79293 states to 79293 states and 149984 transitions. [2025-01-09 05:28:35,015 INFO L78 Accepts]: Start accepts. Automaton has 79293 states and 149984 transitions. Word has length 166 [2025-01-09 05:28:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:35,017 INFO L471 AbstractCegarLoop]: Abstraction has 79293 states and 149984 transitions. [2025-01-09 05:28:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 79293 states and 149984 transitions. [2025-01-09 05:28:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:35,038 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:35,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:35,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 05:28:35,039 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:35,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:35,039 INFO L85 PathProgramCache]: Analyzing trace with hash -432001450, now seen corresponding path program 1 times [2025-01-09 05:28:35,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203091339] [2025-01-09 05:28:35,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:35,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:35,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:35,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:35,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:35,467 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:28:35,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203091339] [2025-01-09 05:28:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203091339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:28:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498992944] [2025-01-09 05:28:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:35,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:28:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:35,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:28:35,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:28:35,469 INFO L87 Difference]: Start difference. First operand 79293 states and 149984 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:41,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:28:41,033 INFO L93 Difference]: Finished difference Result 268011 states and 537014 transitions. [2025-01-09 05:28:41,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:28:41,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 166 [2025-01-09 05:28:41,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:28:42,259 INFO L225 Difference]: With dead ends: 268011 [2025-01-09 05:28:42,260 INFO L226 Difference]: Without dead ends: 190858 [2025-01-09 05:28:42,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:28:42,488 INFO L435 NwaCegarLoop]: 4667 mSDtfsCounter, 4995 mSDsluCounter, 14048 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5014 SdHoareTripleChecker+Valid, 18715 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:28:42,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5014 Valid, 18715 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 05:28:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190858 states. [2025-01-09 05:28:48,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190858 to 188864. [2025-01-09 05:28:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188864 states, 175867 states have (on average 1.7696099893669648) internal successors, (311216), 182176 states have internal predecessors, (311216), 5147 states have call successors, (5147), 1543 states have call predecessors, (5147), 7848 states have return successors, (70681), 5400 states have call predecessors, (70681), 5145 states have call successors, (70681) [2025-01-09 05:28:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188864 states to 188864 states and 387044 transitions. [2025-01-09 05:28:50,699 INFO L78 Accepts]: Start accepts. Automaton has 188864 states and 387044 transitions. Word has length 166 [2025-01-09 05:28:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:28:50,701 INFO L471 AbstractCegarLoop]: Abstraction has 188864 states and 387044 transitions. [2025-01-09 05:28:50,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:28:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 188864 states and 387044 transitions. [2025-01-09 05:28:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 05:28:50,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:28:50,744 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:28:50,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 05:28:50,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:28:50,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:28:50,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2049441900, now seen corresponding path program 1 times [2025-01-09 05:28:50,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:28:50,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248009146] [2025-01-09 05:28:50,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:28:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:28:50,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 05:28:50,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 05:28:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:28:50,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:28:50,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:28:50,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:28:50,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248009146] [2025-01-09 05:28:50,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248009146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:28:50,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:28:50,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:28:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459472781] [2025-01-09 05:28:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:28:50,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:28:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:28:50,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:28:50,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:28:50,856 INFO L87 Difference]: Start difference. First operand 188864 states and 387044 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)