./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.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 b395f094f2d3990354e9b2c1428e908d883c16492f3b21174dd87f3c0cfda780 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:54:38,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:54:38,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:54:38,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:54:38,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:54:38,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:54:38,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:54:38,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:54:38,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:54:38,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:54:38,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:54:38,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:54:38,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:54:38,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:54:38,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:54:38,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:38,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:54:38,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:54:38,165 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 -> b395f094f2d3990354e9b2c1428e908d883c16492f3b21174dd87f3c0cfda780 [2025-02-05 17:54:38,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:54:38,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:54:38,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:54:38,386 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:54:38,386 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:54:38,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2025-02-05 17:54:39,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/296b888f5/d903f05c9ccc46c5b2bcf57da1b9b507/FLAGbbc60f5d1 [2025-02-05 17:54:40,012 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:54:40,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2025-02-05 17:54:40,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/296b888f5/d903f05c9ccc46c5b2bcf57da1b9b507/FLAGbbc60f5d1 [2025-02-05 17:54:40,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/296b888f5/d903f05c9ccc46c5b2bcf57da1b9b507 [2025-02-05 17:54:40,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:54:40,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:54:40,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:40,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:54:40,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:54:40,088 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d319fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40, skipping insertion in model container [2025-02-05 17:54:40,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,124 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:54:40,241 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/pc_sfifo_2.cil-1+token_ring.07.cil-1.c[914,927] [2025-02-05 17:54:40,287 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/pc_sfifo_2.cil-1+token_ring.07.cil-1.c[7115,7128] [2025-02-05 17:54:40,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:40,379 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:54:40,387 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/pc_sfifo_2.cil-1+token_ring.07.cil-1.c[914,927] [2025-02-05 17:54:40,412 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/pc_sfifo_2.cil-1+token_ring.07.cil-1.c[7115,7128] [2025-02-05 17:54:40,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:54:40,499 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:54:40,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40 WrapperNode [2025-02-05 17:54:40,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:54:40,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:40,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:54:40,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:54:40,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,568 INFO L138 Inliner]: procedures = 67, calls = 78, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 726 [2025-02-05 17:54:40,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:54:40,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:54:40,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:54:40,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:54:40,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,612 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 17:54:40,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:54:40,638 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:54:40,640 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:54:40,641 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:54:40,641 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (1/1) ... [2025-02-05 17:54:40,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:54:40,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:54:40,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:54:40,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:54:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:54:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:54:40,685 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:54:40,685 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2025-02-05 17:54:40,685 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:54:40,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:54:40,686 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:54:40,687 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:54:40,785 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:54:40,788 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:54:41,439 INFO L? ?]: Removed 97 outVars from TransFormulas that were not future-live. [2025-02-05 17:54:41,439 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:54:41,457 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:54:41,459 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:54:41,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:41 BoogieIcfgContainer [2025-02-05 17:54:41,460 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:54:41,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:54:41,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:54:41,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:54:41,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:54:40" (1/3) ... [2025-02-05 17:54:41,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40578860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:41, skipping insertion in model container [2025-02-05 17:54:41,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:54:40" (2/3) ... [2025-02-05 17:54:41,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40578860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:54:41, skipping insertion in model container [2025-02-05 17:54:41,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:54:41" (3/3) ... [2025-02-05 17:54:41,467 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.07.cil-1.c [2025-02-05 17:54:41,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:54:41,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_2.cil-1+token_ring.07.cil-1.c that has 15 procedures, 376 locations, 1 initial locations, 14 loop locations, and 2 error locations. [2025-02-05 17:54:41,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:54:41,547 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;@1e4bcb8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:54:41,547 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:54:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 377 states, 324 states have (on average 1.537037037037037) internal successors, (498), 331 states have internal predecessors, (498), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-05 17:54:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:41,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:41,557 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] [2025-02-05 17:54:41,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:41,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:41,561 INFO L85 PathProgramCache]: Analyzing trace with hash -565488999, now seen corresponding path program 1 times [2025-02-05 17:54:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:41,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331241979] [2025-02-05 17:54:41,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:41,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:41,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:41,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:41,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:41,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:41,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:41,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:41,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331241979] [2025-02-05 17:54:41,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331241979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:41,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:41,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:41,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644533234] [2025-02-05 17:54:41,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:41,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:41,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:41,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:41,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:41,805 INFO L87 Difference]: Start difference. First operand has 377 states, 324 states have (on average 1.537037037037037) internal successors, (498), 331 states have internal predecessors, (498), 35 states have call successors, (35), 14 states have call predecessors, (35), 14 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:41,885 INFO L93 Difference]: Finished difference Result 732 states and 1099 transitions. [2025-02-05 17:54:41,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:41,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:41,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:41,895 INFO L225 Difference]: With dead ends: 732 [2025-02-05 17:54:41,895 INFO L226 Difference]: Without dead ends: 366 [2025-02-05 17:54:41,901 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-02-05 17:54:41,903 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 133 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 957 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-02-05 17:54:41,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 957 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-02-05 17:54:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-02-05 17:54:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 316 states have (on average 1.4873417721518987) internal successors, (470), 320 states have internal predecessors, (470), 35 states have call successors, (35), 14 states have call predecessors, (35), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 17:54:41,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 538 transitions. [2025-02-05 17:54:41,966 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 538 transitions. Word has length 65 [2025-02-05 17:54:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 538 transitions. [2025-02-05 17:54:41,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 538 transitions. [2025-02-05 17:54:41,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:41,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:41,971 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] [2025-02-05 17:54:41,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:54:41,971 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:41,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -585826374, now seen corresponding path program 1 times [2025-02-05 17:54:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:41,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831207280] [2025-02-05 17:54:41,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:41,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:41,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:42,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:42,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831207280] [2025-02-05 17:54:42,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831207280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:42,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:42,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65997744] [2025-02-05 17:54:42,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:42,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:42,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:42,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:42,199 INFO L87 Difference]: Start difference. First operand 366 states and 538 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:42,833 INFO L93 Difference]: Finished difference Result 561 states and 808 transitions. [2025-02-05 17:54:42,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:42,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:42,838 INFO L225 Difference]: With dead ends: 561 [2025-02-05 17:54:42,838 INFO L226 Difference]: Without dead ends: 471 [2025-02-05 17:54:42,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:42,841 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 375 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:42,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1173 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-05 17:54:42,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 464. [2025-02-05 17:54:42,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 394 states have (on average 1.4593908629441625) internal successors, (575), 400 states have internal predecessors, (575), 46 states have call successors, (46), 21 states have call predecessors, (46), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2025-02-05 17:54:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 670 transitions. [2025-02-05 17:54:42,871 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 670 transitions. Word has length 65 [2025-02-05 17:54:42,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:42,871 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 670 transitions. [2025-02-05 17:54:42,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2025-02-05 17:54:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:42,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:42,873 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] [2025-02-05 17:54:42,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:54:42,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:42,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash -2021166345, now seen corresponding path program 1 times [2025-02-05 17:54:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:42,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896954619] [2025-02-05 17:54:42,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:42,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:42,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:42,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:42,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:43,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:43,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896954619] [2025-02-05 17:54:43,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896954619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:43,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:43,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:43,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851542939] [2025-02-05 17:54:43,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:43,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:43,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:43,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:43,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:43,038 INFO L87 Difference]: Start difference. First operand 464 states and 670 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:43,686 INFO L93 Difference]: Finished difference Result 787 states and 1103 transitions. [2025-02-05 17:54:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:43,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 17:54:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:43,690 INFO L225 Difference]: With dead ends: 787 [2025-02-05 17:54:43,690 INFO L226 Difference]: Without dead ends: 606 [2025-02-05 17:54:43,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:43,691 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 793 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:43,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 1411 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-02-05 17:54:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 562. [2025-02-05 17:54:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 472 states have (on average 1.4385593220338984) internal successors, (679), 480 states have internal predecessors, (679), 57 states have call successors, (57), 28 states have call predecessors, (57), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2025-02-05 17:54:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 804 transitions. [2025-02-05 17:54:43,728 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 804 transitions. Word has length 65 [2025-02-05 17:54:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:43,729 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 804 transitions. [2025-02-05 17:54:43,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 804 transitions. [2025-02-05 17:54:43,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:43,731 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:43,731 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] [2025-02-05 17:54:43,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:54:43,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:43,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash -887975752, now seen corresponding path program 1 times [2025-02-05 17:54:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531632246] [2025-02-05 17:54:43,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:43,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:43,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:43,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:43,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531632246] [2025-02-05 17:54:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531632246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:43,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:43,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:43,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627485785] [2025-02-05 17:54:43,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:43,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:43,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:43,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:43,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:43,800 INFO L87 Difference]: Start difference. First operand 562 states and 804 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:43,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:43,842 INFO L93 Difference]: Finished difference Result 840 states and 1180 transitions. [2025-02-05 17:54:43,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:43,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-02-05 17:54:43,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:43,845 INFO L225 Difference]: With dead ends: 840 [2025-02-05 17:54:43,845 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 17:54:43,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:43,847 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:43,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2670 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 17:54:43,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 17:54:43,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 476 states have (on average 1.430672268907563) internal successors, (681), 484 states have internal predecessors, (681), 57 states have call successors, (57), 28 states have call predecessors, (57), 32 states have return successors, (69), 58 states have call predecessors, (69), 55 states have call successors, (69) [2025-02-05 17:54:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 807 transitions. [2025-02-05 17:54:43,885 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 807 transitions. Word has length 65 [2025-02-05 17:54:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:43,885 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 807 transitions. [2025-02-05 17:54:43,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 807 transitions. [2025-02-05 17:54:43,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 17:54:43,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:43,887 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] [2025-02-05 17:54:43,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:54:43,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:43,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:43,888 INFO L85 PathProgramCache]: Analyzing trace with hash 744828247, now seen corresponding path program 1 times [2025-02-05 17:54:43,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:43,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386237122] [2025-02-05 17:54:43,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:43,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:43,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 17:54:43,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 17:54:43,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:43,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:44,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:44,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386237122] [2025-02-05 17:54:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386237122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:44,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121692883] [2025-02-05 17:54:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:44,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:44,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:44,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:44,042 INFO L87 Difference]: Start difference. First operand 567 states and 807 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:54:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:44,634 INFO L93 Difference]: Finished difference Result 2601 states and 3578 transitions. [2025-02-05 17:54:44,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:44,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2025-02-05 17:54:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:44,650 INFO L225 Difference]: With dead ends: 2601 [2025-02-05 17:54:44,650 INFO L226 Difference]: Without dead ends: 2323 [2025-02-05 17:54:44,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:54:44,652 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 1568 mSDsluCounter, 1518 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 2318 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:44,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 2318 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:44,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2025-02-05 17:54:44,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2163. [2025-02-05 17:54:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1733 states have (on average 1.3421811886901327) internal successors, (2326), 1769 states have internal predecessors, (2326), 222 states have call successors, (222), 172 states have call predecessors, (222), 206 states have return successors, (338), 225 states have call predecessors, (338), 220 states have call successors, (338) [2025-02-05 17:54:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2886 transitions. [2025-02-05 17:54:44,812 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2886 transitions. Word has length 65 [2025-02-05 17:54:44,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:44,812 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 2886 transitions. [2025-02-05 17:54:44,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2025-02-05 17:54:44,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2886 transitions. [2025-02-05 17:54:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:44,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:44,814 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] [2025-02-05 17:54:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:54:44,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:44,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:44,814 INFO L85 PathProgramCache]: Analyzing trace with hash 121635805, now seen corresponding path program 1 times [2025-02-05 17:54:44,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:44,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221363260] [2025-02-05 17:54:44,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:44,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:44,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:44,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:44,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:44,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:44,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221363260] [2025-02-05 17:54:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221363260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:44,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:44,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180365567] [2025-02-05 17:54:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:44,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:44,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:44,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:44,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:44,884 INFO L87 Difference]: Start difference. First operand 2163 states and 2886 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:45,051 INFO L93 Difference]: Finished difference Result 4082 states and 5446 transitions. [2025-02-05 17:54:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-02-05 17:54:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:45,062 INFO L225 Difference]: With dead ends: 4082 [2025-02-05 17:54:45,062 INFO L226 Difference]: Without dead ends: 2208 [2025-02-05 17:54:45,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:45,068 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 0 mSDsluCounter, 2135 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:45,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2670 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2025-02-05 17:54:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2208. [2025-02-05 17:54:45,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 1769 states have (on average 1.3267382702091577) internal successors, (2347), 1805 states have internal predecessors, (2347), 222 states have call successors, (222), 172 states have call predecessors, (222), 215 states have return successors, (356), 234 states have call predecessors, (356), 220 states have call successors, (356) [2025-02-05 17:54:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 2925 transitions. [2025-02-05 17:54:45,174 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 2925 transitions. Word has length 66 [2025-02-05 17:54:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:45,174 INFO L471 AbstractCegarLoop]: Abstraction has 2208 states and 2925 transitions. [2025-02-05 17:54:45,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 2925 transitions. [2025-02-05 17:54:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:45,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:45,176 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] [2025-02-05 17:54:45,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:54:45,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 132951932, now seen corresponding path program 1 times [2025-02-05 17:54:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960293900] [2025-02-05 17:54:45,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:45,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:45,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:45,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:45,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:45,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:45,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:45,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960293900] [2025-02-05 17:54:45,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960293900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:45,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:45,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:45,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771619876] [2025-02-05 17:54:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:45,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:45,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:45,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:45,295 INFO L87 Difference]: Start difference. First operand 2208 states and 2925 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:46,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:46,166 INFO L93 Difference]: Finished difference Result 3967 states and 5170 transitions. [2025-02-05 17:54:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 17:54:46,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:54:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:46,178 INFO L225 Difference]: With dead ends: 3967 [2025-02-05 17:54:46,178 INFO L226 Difference]: Without dead ends: 2410 [2025-02-05 17:54:46,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 17:54:46,183 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 783 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:46,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1197 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:54:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2025-02-05 17:54:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2218. [2025-02-05 17:54:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 1781 states have (on average 1.3206064008983718) internal successors, (2352), 1812 states have internal predecessors, (2352), 223 states have call successors, (223), 173 states have call predecessors, (223), 212 states have return successors, (340), 236 states have call predecessors, (340), 221 states have call successors, (340) [2025-02-05 17:54:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 2915 transitions. [2025-02-05 17:54:46,320 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 2915 transitions. Word has length 66 [2025-02-05 17:54:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:46,320 INFO L471 AbstractCegarLoop]: Abstraction has 2218 states and 2915 transitions. [2025-02-05 17:54:46,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 2915 transitions. [2025-02-05 17:54:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 17:54:46,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:46,324 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] [2025-02-05 17:54:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:54:46,324 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1944257411, now seen corresponding path program 1 times [2025-02-05 17:54:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:46,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864428938] [2025-02-05 17:54:46,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:46,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 17:54:46,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 17:54:46,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:46,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:46,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:46,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864428938] [2025-02-05 17:54:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864428938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:46,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:46,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:54:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650376671] [2025-02-05 17:54:46,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:54:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:46,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:54:46,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:54:46,393 INFO L87 Difference]: Start difference. First operand 2218 states and 2915 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:46,902 INFO L93 Difference]: Finished difference Result 5763 states and 7530 transitions. [2025-02-05 17:54:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 17:54:46,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 17:54:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:46,920 INFO L225 Difference]: With dead ends: 5763 [2025-02-05 17:54:46,921 INFO L226 Difference]: Without dead ends: 3837 [2025-02-05 17:54:46,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:46,926 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 737 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:46,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 602 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:54:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2025-02-05 17:54:47,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 3833. [2025-02-05 17:54:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3040 states have (on average 1.2825657894736842) internal successors, (3899), 3095 states have internal predecessors, (3899), 392 states have call successors, (392), 318 states have call predecessors, (392), 399 states have return successors, (672), 423 states have call predecessors, (672), 390 states have call successors, (672) [2025-02-05 17:54:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 4963 transitions. [2025-02-05 17:54:47,243 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 4963 transitions. Word has length 66 [2025-02-05 17:54:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:47,243 INFO L471 AbstractCegarLoop]: Abstraction has 3833 states and 4963 transitions. [2025-02-05 17:54:47,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 17:54:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 4963 transitions. [2025-02-05 17:54:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 17:54:47,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:47,247 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] [2025-02-05 17:54:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:54:47,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -333793105, now seen corresponding path program 1 times [2025-02-05 17:54:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169421074] [2025-02-05 17:54:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:47,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 17:54:47,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 17:54:47,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:47,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:47,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:47,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169421074] [2025-02-05 17:54:47,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169421074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:47,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:47,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:47,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980791531] [2025-02-05 17:54:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:47,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:47,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:47,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:47,372 INFO L87 Difference]: Start difference. First operand 3833 states and 4963 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:47,527 INFO L93 Difference]: Finished difference Result 4321 states and 5573 transitions. [2025-02-05 17:54:47,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:47,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 17:54:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:47,532 INFO L225 Difference]: With dead ends: 4321 [2025-02-05 17:54:47,532 INFO L226 Difference]: Without dead ends: 729 [2025-02-05 17:54:47,537 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-02-05 17:54:47,538 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 92 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:47,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 926 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:54:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2025-02-05 17:54:47,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 721. [2025-02-05 17:54:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 586 states have (on average 1.31740614334471) internal successors, (772), 594 states have internal predecessors, (772), 78 states have call successors, (78), 49 states have call predecessors, (78), 55 states have return successors, (89), 81 states have call predecessors, (89), 76 states have call successors, (89) [2025-02-05 17:54:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 939 transitions. [2025-02-05 17:54:47,565 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 939 transitions. Word has length 67 [2025-02-05 17:54:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:47,565 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 939 transitions. [2025-02-05 17:54:47,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:54:47,565 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 939 transitions. [2025-02-05 17:54:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 17:54:47,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:47,567 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:47,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:54:47,567 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:47,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1851660027, now seen corresponding path program 1 times [2025-02-05 17:54:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:47,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504460123] [2025-02-05 17:54:47,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:47,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:47,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 17:54:47,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 17:54:47,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:47,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 17:54:47,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504460123] [2025-02-05 17:54:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504460123] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384697666] [2025-02-05 17:54:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:47,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:47,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:47,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:47,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:47,648 INFO L87 Difference]: Start difference. First operand 721 states and 939 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:54:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:48,897 INFO L93 Difference]: Finished difference Result 1595 states and 1946 transitions. [2025-02-05 17:54:48,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 17:54:48,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2025-02-05 17:54:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:48,909 INFO L225 Difference]: With dead ends: 1595 [2025-02-05 17:54:48,910 INFO L226 Difference]: Without dead ends: 956 [2025-02-05 17:54:48,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-02-05 17:54:48,912 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 528 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:48,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 1498 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 17:54:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-02-05 17:54:49,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 937. [2025-02-05 17:54:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 752 states have (on average 1.2699468085106382) internal successors, (955), 762 states have internal predecessors, (955), 102 states have call successors, (102), 70 states have call predecessors, (102), 81 states have return successors, (120), 108 states have call predecessors, (120), 100 states have call successors, (120) [2025-02-05 17:54:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1177 transitions. [2025-02-05 17:54:49,043 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1177 transitions. Word has length 84 [2025-02-05 17:54:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1177 transitions. [2025-02-05 17:54:49,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 17:54:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1177 transitions. [2025-02-05 17:54:49,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:49,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:49,048 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] [2025-02-05 17:54:49,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:54:49,049 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:49,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:49,050 INFO L85 PathProgramCache]: Analyzing trace with hash -321833339, now seen corresponding path program 1 times [2025-02-05 17:54:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:49,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402202309] [2025-02-05 17:54:49,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:49,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:49,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:49,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:49,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:49,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:49,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402202309] [2025-02-05 17:54:49,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402202309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:49,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:49,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:54:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034750392] [2025-02-05 17:54:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:49,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:54:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:49,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:54:49,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:54:49,100 INFO L87 Difference]: Start difference. First operand 937 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:49,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:49,170 INFO L93 Difference]: Finished difference Result 1197 states and 1571 transitions. [2025-02-05 17:54:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:54:49,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:49,184 INFO L225 Difference]: With dead ends: 1197 [2025-02-05 17:54:49,184 INFO L226 Difference]: Without dead ends: 937 [2025-02-05 17:54:49,185 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-02-05 17:54:49,186 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 398 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 624 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-02-05 17:54:49,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 624 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:54:49,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2025-02-05 17:54:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2025-02-05 17:54:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 752 states have (on average 1.2686170212765957) internal successors, (954), 762 states have internal predecessors, (954), 102 states have call successors, (102), 70 states have call predecessors, (102), 81 states have return successors, (120), 108 states have call predecessors, (120), 100 states have call successors, (120) [2025-02-05 17:54:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1176 transitions. [2025-02-05 17:54:49,226 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1176 transitions. Word has length 123 [2025-02-05 17:54:49,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:49,226 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1176 transitions. [2025-02-05 17:54:49,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1176 transitions. [2025-02-05 17:54:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:49,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:49,229 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] [2025-02-05 17:54:49,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:54:49,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:49,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:49,230 INFO L85 PathProgramCache]: Analyzing trace with hash 962077828, now seen corresponding path program 1 times [2025-02-05 17:54:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:49,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483339976] [2025-02-05 17:54:49,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:49,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:49,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:49,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:49,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:49,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:49,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:49,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483339976] [2025-02-05 17:54:49,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483339976] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:49,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:49,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:54:49,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232098070] [2025-02-05 17:54:49,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:49,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:54:49,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:49,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:54:49,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:54:49,428 INFO L87 Difference]: Start difference. First operand 937 states and 1176 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:50,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:50,500 INFO L93 Difference]: Finished difference Result 1471 states and 1996 transitions. [2025-02-05 17:54:50,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:54:50,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:50,508 INFO L225 Difference]: With dead ends: 1471 [2025-02-05 17:54:50,508 INFO L226 Difference]: Without dead ends: 1218 [2025-02-05 17:54:50,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:50,510 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 879 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:50,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 1261 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 17:54:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-02-05 17:54:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1199. [2025-02-05 17:54:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 991 states have (on average 1.3329969727547932) internal successors, (1321), 1002 states have internal predecessors, (1321), 118 states have call successors, (118), 76 states have call predecessors, (118), 88 states have return successors, (137), 124 states have call predecessors, (137), 116 states have call successors, (137) [2025-02-05 17:54:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1576 transitions. [2025-02-05 17:54:50,612 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1576 transitions. Word has length 123 [2025-02-05 17:54:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:50,613 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1576 transitions. [2025-02-05 17:54:50,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1576 transitions. [2025-02-05 17:54:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:50,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:50,616 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] [2025-02-05 17:54:50,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:54:50,617 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:50,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1548187834, now seen corresponding path program 1 times [2025-02-05 17:54:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:50,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094042552] [2025-02-05 17:54:50,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:50,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:50,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:50,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094042552] [2025-02-05 17:54:50,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094042552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:50,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:50,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891268807] [2025-02-05 17:54:50,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:50,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:50,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:50,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:50,753 INFO L87 Difference]: Start difference. First operand 1199 states and 1576 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:51,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:51,403 INFO L93 Difference]: Finished difference Result 2042 states and 2881 transitions. [2025-02-05 17:54:51,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:51,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:51,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:51,410 INFO L225 Difference]: With dead ends: 2042 [2025-02-05 17:54:51,410 INFO L226 Difference]: Without dead ends: 1527 [2025-02-05 17:54:51,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:51,412 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 879 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 2347 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:51,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 2347 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-02-05 17:54:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1444. [2025-02-05 17:54:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1213 states have (on average 1.3635614179719704) internal successors, (1654), 1225 states have internal predecessors, (1654), 134 states have call successors, (134), 82 states have call predecessors, (134), 95 states have return successors, (156), 141 states have call predecessors, (156), 132 states have call successors, (156) [2025-02-05 17:54:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1944 transitions. [2025-02-05 17:54:51,484 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1944 transitions. Word has length 123 [2025-02-05 17:54:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1944 transitions. [2025-02-05 17:54:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1944 transitions. [2025-02-05 17:54:51,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:51,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:51,486 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] [2025-02-05 17:54:51,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:54:51,486 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:51,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:51,486 INFO L85 PathProgramCache]: Analyzing trace with hash -853540827, now seen corresponding path program 1 times [2025-02-05 17:54:51,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826035387] [2025-02-05 17:54:51,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:51,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:51,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:51,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:51,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:51,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:51,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826035387] [2025-02-05 17:54:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826035387] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:51,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:51,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173673735] [2025-02-05 17:54:51,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:51,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:51,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:51,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:51,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:51,607 INFO L87 Difference]: Start difference. First operand 1444 states and 1944 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:52,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:52,295 INFO L93 Difference]: Finished difference Result 2817 states and 4064 transitions. [2025-02-05 17:54:52,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:52,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:52,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:52,304 INFO L225 Difference]: With dead ends: 2817 [2025-02-05 17:54:52,304 INFO L226 Difference]: Without dead ends: 2057 [2025-02-05 17:54:52,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:52,306 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 874 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 2331 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:52,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 2331 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2025-02-05 17:54:52,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1963. [2025-02-05 17:54:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1963 states, 1684 states have (on average 1.407957244655582) internal successors, (2371), 1700 states have internal predecessors, (2371), 166 states have call successors, (166), 94 states have call predecessors, (166), 111 states have return successors, (200), 175 states have call predecessors, (200), 164 states have call successors, (200) [2025-02-05 17:54:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2737 transitions. [2025-02-05 17:54:52,393 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2737 transitions. Word has length 123 [2025-02-05 17:54:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 1963 states and 2737 transitions. [2025-02-05 17:54:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2737 transitions. [2025-02-05 17:54:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:52,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:52,397 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] [2025-02-05 17:54:52,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:54:52,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:52,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:52,397 INFO L85 PathProgramCache]: Analyzing trace with hash 277245798, now seen corresponding path program 1 times [2025-02-05 17:54:52,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:52,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250166025] [2025-02-05 17:54:52,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:52,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:52,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:52,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:52,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:52,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:52,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:52,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250166025] [2025-02-05 17:54:52,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250166025] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:52,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:52,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:52,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251682519] [2025-02-05 17:54:52,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:52,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:52,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:52,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:52,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:52,523 INFO L87 Difference]: Start difference. First operand 1963 states and 2737 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:53,252 INFO L93 Difference]: Finished difference Result 4478 states and 6655 transitions. [2025-02-05 17:54:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:53,265 INFO L225 Difference]: With dead ends: 4478 [2025-02-05 17:54:53,265 INFO L226 Difference]: Without dead ends: 3199 [2025-02-05 17:54:53,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:53,269 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 869 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2319 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:53,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2319 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2025-02-05 17:54:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3082. [2025-02-05 17:54:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 2701 states have (on average 1.4613106256941872) internal successors, (3947), 2731 states have internal predecessors, (3947), 230 states have call successors, (230), 118 states have call predecessors, (230), 149 states have return successors, (312), 243 states have call predecessors, (312), 228 states have call successors, (312) [2025-02-05 17:54:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 4489 transitions. [2025-02-05 17:54:53,424 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 4489 transitions. Word has length 123 [2025-02-05 17:54:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:53,424 INFO L471 AbstractCegarLoop]: Abstraction has 3082 states and 4489 transitions. [2025-02-05 17:54:53,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 4489 transitions. [2025-02-05 17:54:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:53,427 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:53,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:54:53,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:54:53,427 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash -656108539, now seen corresponding path program 1 times [2025-02-05 17:54:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928502769] [2025-02-05 17:54:53,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:53,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:53,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:53,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:53,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:53,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:53,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:53,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928502769] [2025-02-05 17:54:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928502769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:53,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533418380] [2025-02-05 17:54:53,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:53,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:53,531 INFO L87 Difference]: Start difference. First operand 3082 states and 4489 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:54,274 INFO L93 Difference]: Finished difference Result 8105 states and 12489 transitions. [2025-02-05 17:54:54,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:54,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:54,295 INFO L225 Difference]: With dead ends: 8105 [2025-02-05 17:54:54,296 INFO L226 Difference]: Without dead ends: 5707 [2025-02-05 17:54:54,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:54,302 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 864 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:54,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 2307 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:54:54,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2025-02-05 17:54:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5545. [2025-02-05 17:54:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5545 states, 4942 states have (on average 1.5157830837717523) internal successors, (7491), 5018 states have internal predecessors, (7491), 358 states have call successors, (358), 166 states have call predecessors, (358), 243 states have return successors, (632), 379 states have call predecessors, (632), 356 states have call successors, (632) [2025-02-05 17:54:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 8481 transitions. [2025-02-05 17:54:54,534 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 8481 transitions. Word has length 123 [2025-02-05 17:54:54,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:54,534 INFO L471 AbstractCegarLoop]: Abstraction has 5545 states and 8481 transitions. [2025-02-05 17:54:54,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 8481 transitions. [2025-02-05 17:54:54,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:54,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:54,539 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] [2025-02-05 17:54:54,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 17:54:54,540 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:54,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 837803910, now seen corresponding path program 1 times [2025-02-05 17:54:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902233888] [2025-02-05 17:54:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:54,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902233888] [2025-02-05 17:54:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902233888] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549897388] [2025-02-05 17:54:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:54,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:54,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:54,694 INFO L87 Difference]: Start difference. First operand 5545 states and 8481 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:55,980 INFO L93 Difference]: Finished difference Result 16200 states and 26091 transitions. [2025-02-05 17:54:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:55,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:56,045 INFO L225 Difference]: With dead ends: 16200 [2025-02-05 17:54:56,045 INFO L226 Difference]: Without dead ends: 11339 [2025-02-05 17:54:56,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:56,063 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 859 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:56,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2295 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:54:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11339 states. [2025-02-05 17:54:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11339 to 11092. [2025-02-05 17:54:56,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11092 states, 9991 states have (on average 1.5665098588729858) internal successors, (15651), 10213 states have internal predecessors, (15651), 614 states have call successors, (614), 262 states have call predecessors, (614), 485 states have return successors, (1656), 651 states have call predecessors, (1656), 612 states have call successors, (1656) [2025-02-05 17:54:56,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11092 states to 11092 states and 17921 transitions. [2025-02-05 17:54:56,480 INFO L78 Accepts]: Start accepts. Automaton has 11092 states and 17921 transitions. Word has length 123 [2025-02-05 17:54:56,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:56,480 INFO L471 AbstractCegarLoop]: Abstraction has 11092 states and 17921 transitions. [2025-02-05 17:54:56,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:56,480 INFO L276 IsEmpty]: Start isEmpty. Operand 11092 states and 17921 transitions. [2025-02-05 17:54:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:56,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:56,487 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] [2025-02-05 17:54:56,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 17:54:56,487 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:56,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:56,488 INFO L85 PathProgramCache]: Analyzing trace with hash -360931355, now seen corresponding path program 1 times [2025-02-05 17:54:56,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:56,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193209061] [2025-02-05 17:54:56,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:56,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:56,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:56,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:56,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:56,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:56,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:56,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193209061] [2025-02-05 17:54:56,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193209061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:56,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:56,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:56,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511712169] [2025-02-05 17:54:56,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:56,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:56,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:56,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:56,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:56,598 INFO L87 Difference]: Start difference. First operand 11092 states and 17921 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:54:57,774 INFO L93 Difference]: Finished difference Result 34699 states and 59161 transitions. [2025-02-05 17:54:57,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:54:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:54:57,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:54:57,861 INFO L225 Difference]: With dead ends: 34699 [2025-02-05 17:54:57,861 INFO L226 Difference]: Without dead ends: 24291 [2025-02-05 17:54:57,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:54:57,895 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 854 mSDsluCounter, 1710 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:54:57,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 2283 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:54:57,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24291 states. [2025-02-05 17:54:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24291 to 23887. [2025-02-05 17:54:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23887 states, 21628 states have (on average 1.612308119104864) internal successors, (34871), 22304 states have internal predecessors, (34871), 1126 states have call successors, (1126), 454 states have call predecessors, (1126), 1131 states have return successors, (5240), 1195 states have call predecessors, (5240), 1124 states have call successors, (5240) [2025-02-05 17:54:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23887 states to 23887 states and 41237 transitions. [2025-02-05 17:54:58,946 INFO L78 Accepts]: Start accepts. Automaton has 23887 states and 41237 transitions. Word has length 123 [2025-02-05 17:54:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:54:58,946 INFO L471 AbstractCegarLoop]: Abstraction has 23887 states and 41237 transitions. [2025-02-05 17:54:58,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:54:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 23887 states and 41237 transitions. [2025-02-05 17:54:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:54:58,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:54:58,957 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] [2025-02-05 17:54:58,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 17:54:58,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:54:58,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:54:58,959 INFO L85 PathProgramCache]: Analyzing trace with hash 154589094, now seen corresponding path program 1 times [2025-02-05 17:54:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:54:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705323291] [2025-02-05 17:54:58,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:54:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:54:58,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:54:58,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:54:58,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:54:58,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:54:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:54:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:54:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705323291] [2025-02-05 17:54:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705323291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:54:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:54:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:54:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254641715] [2025-02-05 17:54:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:54:59,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:54:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:54:59,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:54:59,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:54:59,064 INFO L87 Difference]: Start difference. First operand 23887 states and 41237 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:01,465 INFO L93 Difference]: Finished difference Result 77986 states and 143567 transitions. [2025-02-05 17:55:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:55:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:01,731 INFO L225 Difference]: With dead ends: 77986 [2025-02-05 17:55:01,731 INFO L226 Difference]: Without dead ends: 54783 [2025-02-05 17:55:01,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:55:01,814 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 849 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:01,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 2271 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:55:01,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54783 states. [2025-02-05 17:55:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54783 to 54094. [2025-02-05 17:55:03,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54094 states, 49033 states have (on average 1.653070381171864) internal successors, (81055), 51103 states have internal predecessors, (81055), 2150 states have call successors, (2150), 838 states have call predecessors, (2150), 2909 states have return successors, (18552), 2283 states have call predecessors, (18552), 2148 states have call successors, (18552) [2025-02-05 17:55:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54094 states to 54094 states and 101757 transitions. [2025-02-05 17:55:04,369 INFO L78 Accepts]: Start accepts. Automaton has 54094 states and 101757 transitions. Word has length 123 [2025-02-05 17:55:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:04,370 INFO L471 AbstractCegarLoop]: Abstraction has 54094 states and 101757 transitions. [2025-02-05 17:55:04,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 54094 states and 101757 transitions. [2025-02-05 17:55:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:55:04,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:04,390 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] [2025-02-05 17:55:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 17:55:04,391 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:04,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:04,392 INFO L85 PathProgramCache]: Analyzing trace with hash -798612539, now seen corresponding path program 1 times [2025-02-05 17:55:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906018069] [2025-02-05 17:55:04,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:04,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:55:04,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:55:04,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:04,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906018069] [2025-02-05 17:55:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906018069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:04,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973586362] [2025-02-05 17:55:04,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:04,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:04,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:04,473 INFO L87 Difference]: Start difference. First operand 54094 states and 101757 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:09,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:55:09,022 INFO L93 Difference]: Finished difference Result 188421 states and 381566 transitions. [2025-02-05 17:55:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:55:09,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 123 [2025-02-05 17:55:09,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:55:09,721 INFO L225 Difference]: With dead ends: 188421 [2025-02-05 17:55:09,722 INFO L226 Difference]: Without dead ends: 135011 [2025-02-05 17:55:10,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:55:10,188 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 1068 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1101 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:55:10,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1101 Valid, 2246 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:55:10,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135011 states. [2025-02-05 17:55:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135011 to 126517. [2025-02-05 17:55:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126517 states, 114522 states have (on average 1.6897626656886886) internal successors, (193515), 120838 states have internal predecessors, (193515), 4070 states have call successors, (4070), 1606 states have call predecessors, (4070), 7923 states have return successors, (69624), 4331 states have call predecessors, (69624), 4068 states have call successors, (69624) [2025-02-05 17:55:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126517 states to 126517 states and 267209 transitions. [2025-02-05 17:55:18,980 INFO L78 Accepts]: Start accepts. Automaton has 126517 states and 267209 transitions. Word has length 123 [2025-02-05 17:55:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:55:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 126517 states and 267209 transitions. [2025-02-05 17:55:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:55:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 126517 states and 267209 transitions. [2025-02-05 17:55:19,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:55:19,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:55:19,047 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] [2025-02-05 17:55:19,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 17:55:19,048 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:55:19,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:55:19,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1923014, now seen corresponding path program 1 times [2025-02-05 17:55:19,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:55:19,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422453139] [2025-02-05 17:55:19,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:55:19,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:55:19,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:55:19,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:55:19,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:55:19,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:55:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:55:19,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:55:19,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422453139] [2025-02-05 17:55:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422453139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:55:19,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:55:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:55:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43205908] [2025-02-05 17:55:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:55:19,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:55:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:55:19,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:55:19,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:55:19,135 INFO L87 Difference]: Start difference. First operand 126517 states and 267209 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)