./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c775d42bfad3c45ab40b07224c097c48233d7fc79c2c6639ab29adb0162bc4be --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:52:51,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:52:51,430 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:52:51,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:52:51,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:52:51,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:52:51,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:52:51,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:52:51,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:52:51,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:52:51,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:52:51,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:52:51,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:52:51,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:52:51,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:52:51,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:52:51,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:52:51,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:52:51,452 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 -> c775d42bfad3c45ab40b07224c097c48233d7fc79c2c6639ab29adb0162bc4be [2025-02-05 17:52:51,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:52:51,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:52:51,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:52:51,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:52:51,652 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:52:51,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-2.c [2025-02-05 17:52:52,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71d422dc5/06f1b2154fe94052a52fce88c8ff629b/FLAG652811963 [2025-02-05 17:52:53,107 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:52:53,109 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.04.cil-2.c [2025-02-05 17:52:53,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71d422dc5/06f1b2154fe94052a52fce88c8ff629b/FLAG652811963 [2025-02-05 17:52:53,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/71d422dc5/06f1b2154fe94052a52fce88c8ff629b [2025-02-05 17:52:53,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:52:53,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:52:53,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:52:53,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:52:53,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:52:53,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a7971d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53, skipping insertion in model container [2025-02-05 17:52:53,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:52:53,547 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_1.cil-2+token_ring.04.cil-2.c[913,926] [2025-02-05 17:52:53,588 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_1.cil-2+token_ring.04.cil-2.c[5977,5990] [2025-02-05 17:52:53,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:52:53,652 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:52:53,659 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_1.cil-2+token_ring.04.cil-2.c[913,926] [2025-02-05 17:52:53,681 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_1.cil-2+token_ring.04.cil-2.c[5977,5990] [2025-02-05 17:52:53,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:52:53,736 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:52:53,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53 WrapperNode [2025-02-05 17:52:53,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:52:53,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:52:53,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:52:53,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:52:53,744 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:52:53" (1/1) ... [2025-02-05 17:52:53,753 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:52:53" (1/1) ... [2025-02-05 17:52:53,782 INFO L138 Inliner]: procedures = 56, calls = 61, calls flagged for inlining = 30, calls inlined = 30, statements flattened = 576 [2025-02-05 17:52:53,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:52:53,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:52:53,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:52:53,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:52:53,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,818 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:52:53,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:52:53,834 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:52:53,834 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:52:53,834 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:52:53,835 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (1/1) ... [2025-02-05 17:52:53,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:52:53,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:52:53,866 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:52:53,880 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:52:53,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:52:53,901 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:52:53,901 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:52:53,901 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2025-02-05 17:52:53,901 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2025-02-05 17:52:53,901 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2025-02-05 17:52:53,902 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2025-02-05 17:52:53,902 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2025-02-05 17:52:53,987 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:52:53,991 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:52:54,479 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-02-05 17:52:54,479 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:52:54,498 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:52:54,499 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:52:54,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:52:54 BoogieIcfgContainer [2025-02-05 17:52:54,499 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:52:54,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:52:54,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:52:54,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:52:54,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:52:53" (1/3) ... [2025-02-05 17:52:54,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cc365e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:52:54, skipping insertion in model container [2025-02-05 17:52:54,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:52:53" (2/3) ... [2025-02-05 17:52:54,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13cc365e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:52:54, skipping insertion in model container [2025-02-05 17:52:54,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:52:54" (3/3) ... [2025-02-05 17:52:54,508 INFO L128 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.04.cil-2.c [2025-02-05 17:52:54,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:52:54,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pc_sfifo_1.cil-2+token_ring.04.cil-2.c that has 11 procedures, 274 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-02-05 17:52:54,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:52:54,578 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;@3d055263, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:52:54,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:52:54,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 275 states, 235 states have (on average 1.5276595744680852) internal successors, (359), 243 states have internal predecessors, (359), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-05 17:52:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:52:54,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:54,597 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] [2025-02-05 17:52:54,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:54,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:54,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1559872474, now seen corresponding path program 1 times [2025-02-05 17:52:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790676499] [2025-02-05 17:52:54,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:54,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:52:54,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:52:54,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:54,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:54,828 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:52:54,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:54,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790676499] [2025-02-05 17:52:54,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790676499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:54,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:54,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:54,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733243393] [2025-02-05 17:52:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:54,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:54,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:54,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:54,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:54,864 INFO L87 Difference]: Start difference. First operand has 275 states, 235 states have (on average 1.5276595744680852) internal successors, (359), 243 states have internal predecessors, (359), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:52:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:54,914 INFO L93 Difference]: Finished difference Result 531 states and 792 transitions. [2025-02-05 17:52:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-02-05 17:52:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:54,922 INFO L225 Difference]: With dead ends: 531 [2025-02-05 17:52:54,923 INFO L226 Difference]: Without dead ends: 263 [2025-02-05 17:52:54,926 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:52:54,927 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 95 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 684 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:52:54,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 684 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-05 17:52:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2025-02-05 17:52:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 227 states have (on average 1.47136563876652) internal successors, (334), 231 states have internal predecessors, (334), 26 states have call successors, (26), 10 states have call predecessors, (26), 8 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 17:52:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 382 transitions. [2025-02-05 17:52:54,965 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 382 transitions. Word has length 44 [2025-02-05 17:52:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:54,965 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 382 transitions. [2025-02-05 17:52:54,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 17:52:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 382 transitions. [2025-02-05 17:52:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 17:52:54,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:54,967 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] [2025-02-05 17:52:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:52:54,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:54,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1812411239, now seen corresponding path program 1 times [2025-02-05 17:52:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736365629] [2025-02-05 17:52:54,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:54,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 17:52:54,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 17:52:54,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:55,020 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:52:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736365629] [2025-02-05 17:52:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736365629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:55,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:55,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667151648] [2025-02-05 17:52:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:55,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:55,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:55,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:55,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:55,023 INFO L87 Difference]: Start difference. First operand 263 states and 382 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:55,059 INFO L93 Difference]: Finished difference Result 385 states and 549 transitions. [2025-02-05 17:52:55,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:55,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2025-02-05 17:52:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:55,063 INFO L225 Difference]: With dead ends: 385 [2025-02-05 17:52:55,063 INFO L226 Difference]: Without dead ends: 321 [2025-02-05 17:52:55,063 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:52:55,064 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 358 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:55,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 473 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-02-05 17:52:55,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 314. [2025-02-05 17:52:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 273 states have (on average 1.4468864468864469) internal successors, (395), 277 states have internal predecessors, (395), 29 states have call successors, (29), 12 states have call predecessors, (29), 10 states have return successors, (29), 25 states have call predecessors, (29), 25 states have call successors, (29) [2025-02-05 17:52:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 453 transitions. [2025-02-05 17:52:55,093 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 453 transitions. Word has length 44 [2025-02-05 17:52:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:55,094 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 453 transitions. [2025-02-05 17:52:55,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 453 transitions. [2025-02-05 17:52:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-05 17:52:55,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:55,097 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] [2025-02-05 17:52:55,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:52:55,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:55,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:55,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1861806918, now seen corresponding path program 1 times [2025-02-05 17:52:55,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:55,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892770826] [2025-02-05 17:52:55,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:55,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:55,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-05 17:52:55,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-05 17:52:55,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:55,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:55,155 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:52:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892770826] [2025-02-05 17:52:55,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892770826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:55,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:55,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:55,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556368260] [2025-02-05 17:52:55,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:55,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:55,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:55,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:55,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:55,157 INFO L87 Difference]: Start difference. First operand 314 states and 453 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:55,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:55,200 INFO L93 Difference]: Finished difference Result 532 states and 756 transitions. [2025-02-05 17:52:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2025-02-05 17:52:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:55,202 INFO L225 Difference]: With dead ends: 532 [2025-02-05 17:52:55,202 INFO L226 Difference]: Without dead ends: 419 [2025-02-05 17:52:55,203 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:52:55,208 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 357 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:55,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 459 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-05 17:52:55,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 415. [2025-02-05 17:52:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 363 states have (on average 1.4132231404958677) internal successors, (513), 367 states have internal predecessors, (513), 36 states have call successors, (36), 16 states have call predecessors, (36), 14 states have return successors, (40), 32 states have call predecessors, (40), 32 states have call successors, (40) [2025-02-05 17:52:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 589 transitions. [2025-02-05 17:52:55,241 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 589 transitions. Word has length 45 [2025-02-05 17:52:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:55,241 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 589 transitions. [2025-02-05 17:52:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 589 transitions. [2025-02-05 17:52:55,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 17:52:55,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:55,243 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] [2025-02-05 17:52:55,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:52:55,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2084958515, now seen corresponding path program 1 times [2025-02-05 17:52:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:55,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113295793] [2025-02-05 17:52:55,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:55,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 17:52:55,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 17:52:55,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:55,312 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:52:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113295793] [2025-02-05 17:52:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113295793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386479046] [2025-02-05 17:52:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:55,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:55,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:55,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:55,313 INFO L87 Difference]: Start difference. First operand 415 states and 589 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:55,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:55,346 INFO L93 Difference]: Finished difference Result 799 states and 1104 transitions. [2025-02-05 17:52:55,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:55,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2025-02-05 17:52:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:55,350 INFO L225 Difference]: With dead ends: 799 [2025-02-05 17:52:55,350 INFO L226 Difference]: Without dead ends: 579 [2025-02-05 17:52:55,350 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:52:55,351 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 66 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:55,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 768 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:55,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2025-02-05 17:52:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 544. [2025-02-05 17:52:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 478 states have (on average 1.3849372384937237) internal successors, (662), 484 states have internal predecessors, (662), 44 states have call successors, (44), 22 states have call predecessors, (44), 20 states have return successors, (50), 38 states have call predecessors, (50), 40 states have call successors, (50) [2025-02-05 17:52:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 756 transitions. [2025-02-05 17:52:55,374 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 756 transitions. Word has length 46 [2025-02-05 17:52:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:55,374 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 756 transitions. [2025-02-05 17:52:55,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 17:52:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 756 transitions. [2025-02-05 17:52:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 17:52:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:55,376 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] [2025-02-05 17:52:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:52:55,376 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:55,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1976327073, now seen corresponding path program 1 times [2025-02-05 17:52:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:55,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646120273] [2025-02-05 17:52:55,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:55,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 17:52:55,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 17:52:55,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:55,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:55,471 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:52:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646120273] [2025-02-05 17:52:55,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646120273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:55,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:55,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:55,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289805986] [2025-02-05 17:52:55,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:55,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:55,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:55,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:55,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:55,472 INFO L87 Difference]: Start difference. First operand 544 states and 756 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 17:52:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:55,521 INFO L93 Difference]: Finished difference Result 830 states and 1140 transitions. [2025-02-05 17:52:55,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:55,522 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-02-05 17:52:55,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:55,526 INFO L225 Difference]: With dead ends: 830 [2025-02-05 17:52:55,532 INFO L226 Difference]: Without dead ends: 605 [2025-02-05 17:52:55,533 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:52:55,533 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 54 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:55,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 812 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-05 17:52:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2025-02-05 17:52:55,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 531 states have (on average 1.3578154425612052) internal successors, (721), 537 states have internal predecessors, (721), 49 states have call successors, (49), 25 states have call predecessors, (49), 23 states have return successors, (58), 43 states have call predecessors, (58), 45 states have call successors, (58) [2025-02-05 17:52:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 828 transitions. [2025-02-05 17:52:55,564 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 828 transitions. Word has length 63 [2025-02-05 17:52:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:55,564 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 828 transitions. [2025-02-05 17:52:55,564 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-05 17:52:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 828 transitions. [2025-02-05 17:52:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 17:52:55,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:55,565 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] [2025-02-05 17:52:55,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:52:55,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:55,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash 753279451, now seen corresponding path program 1 times [2025-02-05 17:52:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34458034] [2025-02-05 17:52:55,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:55,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:55,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 17:52:55,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 17:52:55,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:55,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 17:52:55,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:55,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34458034] [2025-02-05 17:52:55,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34458034] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:55,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:55,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 17:52:55,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87826456] [2025-02-05 17:52:55,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:55,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:52:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:55,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:52:55,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 17:52:55,637 INFO L87 Difference]: Start difference. First operand 605 states and 828 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:52:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:55,659 INFO L93 Difference]: Finished difference Result 654 states and 888 transitions. [2025-02-05 17:52:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:52:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 68 [2025-02-05 17:52:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:55,660 INFO L225 Difference]: With dead ends: 654 [2025-02-05 17:52:55,660 INFO L226 Difference]: Without dead ends: 195 [2025-02-05 17:52:55,661 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:52:55,663 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:55,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 333 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:52:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-05 17:52:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2025-02-05 17:52:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 168 states have (on average 1.5) internal successors, (252), 170 states have internal predecessors, (252), 20 states have call successors, (20), 7 states have call predecessors, (20), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 17:52:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 290 transitions. [2025-02-05 17:52:55,672 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 290 transitions. Word has length 68 [2025-02-05 17:52:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:55,672 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 290 transitions. [2025-02-05 17:52:55,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 17:52:55,673 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2025-02-05 17:52:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:52:55,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:55,674 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] [2025-02-05 17:52:55,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:52:55,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:55,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:55,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1982592460, now seen corresponding path program 1 times [2025-02-05 17:52:55,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:55,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176061589] [2025-02-05 17:52:55,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:55,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:55,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:52:55,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:52:55,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:55,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:55,827 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:52:55,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:55,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176061589] [2025-02-05 17:52:55,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176061589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:55,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:55,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:52:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621502145] [2025-02-05 17:52:55,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:55,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:52:55,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:55,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:52:55,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:52:55,828 INFO L87 Difference]: Start difference. First operand 195 states and 290 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:56,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:56,163 INFO L93 Difference]: Finished difference Result 575 states and 864 transitions. [2025-02-05 17:52:56,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:52:56,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:52:56,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:56,165 INFO L225 Difference]: With dead ends: 575 [2025-02-05 17:52:56,166 INFO L226 Difference]: Without dead ends: 393 [2025-02-05 17:52:56,167 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:52:56,168 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 496 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:56,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 797 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:52:56,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-02-05 17:52:56,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 378. [2025-02-05 17:52:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 331 states have (on average 1.5105740181268883) internal successors, (500), 334 states have internal predecessors, (500), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (32), 31 states have call predecessors, (32), 31 states have call successors, (32) [2025-02-05 17:52:56,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 565 transitions. [2025-02-05 17:52:56,199 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 565 transitions. Word has length 91 [2025-02-05 17:52:56,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:56,200 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 565 transitions. [2025-02-05 17:52:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:56,200 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 565 transitions. [2025-02-05 17:52:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:52:56,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:56,201 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] [2025-02-05 17:52:56,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:52:56,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:56,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:56,202 INFO L85 PathProgramCache]: Analyzing trace with hash -862461134, now seen corresponding path program 1 times [2025-02-05 17:52:56,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441051728] [2025-02-05 17:52:56,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:56,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:52:56,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:52:56,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:56,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:56,311 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:52:56,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:56,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441051728] [2025-02-05 17:52:56,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441051728] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:56,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:56,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744484843] [2025-02-05 17:52:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:56,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:56,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:56,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:56,313 INFO L87 Difference]: Start difference. First operand 378 states and 565 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:56,822 INFO L93 Difference]: Finished difference Result 970 states and 1463 transitions. [2025-02-05 17:52:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:56,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:52:56,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:56,825 INFO L225 Difference]: With dead ends: 970 [2025-02-05 17:52:56,825 INFO L226 Difference]: Without dead ends: 605 [2025-02-05 17:52:56,826 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:52:56,826 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 489 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:56,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1521 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-05 17:52:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 550. [2025-02-05 17:52:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 483 states have (on average 1.5031055900621118) internal successors, (726), 487 states have internal predecessors, (726), 46 states have call successors, (46), 19 states have call predecessors, (46), 20 states have return successors, (48), 45 states have call predecessors, (48), 44 states have call successors, (48) [2025-02-05 17:52:56,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 820 transitions. [2025-02-05 17:52:56,851 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 820 transitions. Word has length 91 [2025-02-05 17:52:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:56,851 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 820 transitions. [2025-02-05 17:52:56,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 820 transitions. [2025-02-05 17:52:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:52:56,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:56,852 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] [2025-02-05 17:52:56,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:52:56,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:56,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash 4591091, now seen corresponding path program 1 times [2025-02-05 17:52:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:56,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777774304] [2025-02-05 17:52:56,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:56,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:56,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:52:56,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:52:56,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:56,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:56,938 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:52:56,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:56,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777774304] [2025-02-05 17:52:56,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777774304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:56,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:56,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:56,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975525624] [2025-02-05 17:52:56,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:56,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:56,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:56,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:56,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:56,940 INFO L87 Difference]: Start difference. First operand 550 states and 820 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:57,415 INFO L93 Difference]: Finished difference Result 1508 states and 2271 transitions. [2025-02-05 17:52:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:52:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:57,421 INFO L225 Difference]: With dead ends: 1508 [2025-02-05 17:52:57,421 INFO L226 Difference]: Without dead ends: 971 [2025-02-05 17:52:57,423 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:52:57,424 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 484 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:57,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1505 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:57,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-02-05 17:52:57,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 911. [2025-02-05 17:52:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 802 states have (on average 1.5024937655860349) internal successors, (1205), 810 states have internal predecessors, (1205), 72 states have call successors, (72), 31 states have call predecessors, (72), 36 states have return successors, (86), 73 states have call predecessors, (86), 70 states have call successors, (86) [2025-02-05 17:52:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1363 transitions. [2025-02-05 17:52:57,467 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1363 transitions. Word has length 91 [2025-02-05 17:52:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:57,468 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1363 transitions. [2025-02-05 17:52:57,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1363 transitions. [2025-02-05 17:52:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:52:57,469 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:57,469 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] [2025-02-05 17:52:57,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:52:57,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:57,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash 448202514, now seen corresponding path program 1 times [2025-02-05 17:52:57,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:57,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329403920] [2025-02-05 17:52:57,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:57,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:52:57,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:52:57,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:57,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:57,592 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:52:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329403920] [2025-02-05 17:52:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329403920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613765684] [2025-02-05 17:52:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:57,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:57,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:57,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:57,594 INFO L87 Difference]: Start difference. First operand 911 states and 1363 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:58,048 INFO L93 Difference]: Finished difference Result 2647 states and 4016 transitions. [2025-02-05 17:52:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:58,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:52:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:58,056 INFO L225 Difference]: With dead ends: 2647 [2025-02-05 17:52:58,056 INFO L226 Difference]: Without dead ends: 1749 [2025-02-05 17:52:58,059 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:52:58,059 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 479 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:58,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 1493 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-02-05 17:52:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1678. [2025-02-05 17:52:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1479 states have (on average 1.5098039215686274) internal successors, (2233), 1501 states have internal predecessors, (2233), 124 states have call successors, (124), 55 states have call predecessors, (124), 74 states have return successors, (186), 129 states have call predecessors, (186), 122 states have call successors, (186) [2025-02-05 17:52:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2543 transitions. [2025-02-05 17:52:58,153 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2543 transitions. Word has length 91 [2025-02-05 17:52:58,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:58,153 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2543 transitions. [2025-02-05 17:52:58,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2543 transitions. [2025-02-05 17:52:58,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:52:58,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:58,155 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] [2025-02-05 17:52:58,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:52:58,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:58,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash -507318765, now seen corresponding path program 1 times [2025-02-05 17:52:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020471257] [2025-02-05 17:52:58,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:58,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:58,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:52:58,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:52:58,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:58,236 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:52:58,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:58,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020471257] [2025-02-05 17:52:58,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020471257] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:58,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:58,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9625938] [2025-02-05 17:52:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:58,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:58,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:58,238 INFO L87 Difference]: Start difference. First operand 1678 states and 2543 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:58,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:58,749 INFO L93 Difference]: Finished difference Result 5086 states and 7870 transitions. [2025-02-05 17:52:58,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:58,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:52:58,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:58,765 INFO L225 Difference]: With dead ends: 5086 [2025-02-05 17:52:58,765 INFO L226 Difference]: Without dead ends: 3421 [2025-02-05 17:52:58,770 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:52:58,770 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 474 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:58,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1481 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2025-02-05 17:52:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3329. [2025-02-05 17:52:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 2932 states have (on average 1.5228512960436562) internal successors, (4465), 3000 states have internal predecessors, (4465), 228 states have call successors, (228), 103 states have call predecessors, (228), 168 states have return successors, (482), 241 states have call predecessors, (482), 226 states have call successors, (482) [2025-02-05 17:52:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 5175 transitions. [2025-02-05 17:52:58,967 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 5175 transitions. Word has length 91 [2025-02-05 17:52:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:52:58,967 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 5175 transitions. [2025-02-05 17:52:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 5175 transitions. [2025-02-05 17:52:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:52:58,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:52:58,970 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] [2025-02-05 17:52:58,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:52:58,970 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:52:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:52:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1678615282, now seen corresponding path program 1 times [2025-02-05 17:52:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:52:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371010958] [2025-02-05 17:52:58,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:52:58,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:52:58,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:52:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:52:58,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:52:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:52:59,066 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:52:59,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:52:59,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371010958] [2025-02-05 17:52:59,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371010958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:52:59,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:52:59,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:52:59,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681559471] [2025-02-05 17:52:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:52:59,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:52:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:52:59,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:52:59,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:52:59,068 INFO L87 Difference]: Start difference. First operand 3329 states and 5175 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:52:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:52:59,682 INFO L93 Difference]: Finished difference Result 10901 states and 17433 transitions. [2025-02-05 17:52:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:52:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:52:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:52:59,719 INFO L225 Difference]: With dead ends: 10901 [2025-02-05 17:52:59,719 INFO L226 Difference]: Without dead ends: 7585 [2025-02-05 17:52:59,728 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:52:59,728 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 603 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:52:59,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1456 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:52:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7585 states. [2025-02-05 17:53:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7585 to 6880. [2025-02-05 17:53:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6880 states, 6049 states have (on average 1.5409158538601422) internal successors, (9321), 6263 states have internal predecessors, (9321), 420 states have call successors, (420), 199 states have call predecessors, (420), 410 states have return successors, (1442), 449 states have call predecessors, (1442), 418 states have call successors, (1442) [2025-02-05 17:53:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6880 states to 6880 states and 11183 transitions. [2025-02-05 17:53:00,116 INFO L78 Accepts]: Start accepts. Automaton has 6880 states and 11183 transitions. Word has length 91 [2025-02-05 17:53:00,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:00,116 INFO L471 AbstractCegarLoop]: Abstraction has 6880 states and 11183 transitions. [2025-02-05 17:53:00,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:00,116 INFO L276 IsEmpty]: Start isEmpty. Operand 6880 states and 11183 transitions. [2025-02-05 17:53:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:53:00,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:00,120 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] [2025-02-05 17:53:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:53:00,120 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1194939955, now seen corresponding path program 1 times [2025-02-05 17:53:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405668353] [2025-02-05 17:53:00,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:00,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:53:00,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:53:00,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:00,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:00,234 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:53:00,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:00,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405668353] [2025-02-05 17:53:00,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405668353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:00,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:00,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936325609] [2025-02-05 17:53:00,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:00,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:00,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:00,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:00,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:00,236 INFO L87 Difference]: Start difference. First operand 6880 states and 11183 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:00,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:00,990 INFO L93 Difference]: Finished difference Result 22146 states and 37643 transitions. [2025-02-05 17:53:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:00,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:53:00,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:01,061 INFO L225 Difference]: With dead ends: 22146 [2025-02-05 17:53:01,061 INFO L226 Difference]: Without dead ends: 15279 [2025-02-05 17:53:01,082 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:53:01,082 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 535 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:01,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1430 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15279 states. [2025-02-05 17:53:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15279 to 14420. [2025-02-05 17:53:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14420 states, 12575 states have (on average 1.548389662027833) internal successors, (19471), 13243 states have internal predecessors, (19471), 788 states have call successors, (788), 391 states have call predecessors, (788), 1056 states have return successors, (4882), 849 states have call predecessors, (4882), 786 states have call successors, (4882) [2025-02-05 17:53:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14420 states to 14420 states and 25141 transitions. [2025-02-05 17:53:01,986 INFO L78 Accepts]: Start accepts. Automaton has 14420 states and 25141 transitions. Word has length 91 [2025-02-05 17:53:01,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:01,986 INFO L471 AbstractCegarLoop]: Abstraction has 14420 states and 25141 transitions. [2025-02-05 17:53:01,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:01,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14420 states and 25141 transitions. [2025-02-05 17:53:01,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:53:01,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:01,994 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] [2025-02-05 17:53:01,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:53:01,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:01,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:01,995 INFO L85 PathProgramCache]: Analyzing trace with hash 948626868, now seen corresponding path program 1 times [2025-02-05 17:53:01,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:01,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359850916] [2025-02-05 17:53:01,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:02,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:53:02,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:53:02,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:02,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:02,063 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:53:02,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:02,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359850916] [2025-02-05 17:53:02,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359850916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:02,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:02,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007268648] [2025-02-05 17:53:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:02,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:02,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:02,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:02,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:02,065 INFO L87 Difference]: Start difference. First operand 14420 states and 25141 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:03,499 INFO L93 Difference]: Finished difference Result 46202 states and 86963 transitions. [2025-02-05 17:53:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:03,500 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:53:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:03,667 INFO L225 Difference]: With dead ends: 46202 [2025-02-05 17:53:03,667 INFO L226 Difference]: Without dead ends: 31795 [2025-02-05 17:53:03,717 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:53:03,718 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 500 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:03,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 1418 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31795 states. [2025-02-05 17:53:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31795 to 30619. [2025-02-05 17:53:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30619 states, 26292 states have (on average 1.5459835691465085) internal successors, (40647), 28354 states have internal predecessors, (40647), 1492 states have call successors, (1492), 775 states have call predecessors, (1492), 2834 states have return successors, (17874), 1617 states have call predecessors, (17874), 1490 states have call successors, (17874) [2025-02-05 17:53:05,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30619 states to 30619 states and 60013 transitions. [2025-02-05 17:53:05,802 INFO L78 Accepts]: Start accepts. Automaton has 30619 states and 60013 transitions. Word has length 91 [2025-02-05 17:53:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 30619 states and 60013 transitions. [2025-02-05 17:53:05,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 30619 states and 60013 transitions. [2025-02-05 17:53:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:53:05,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:05,821 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] [2025-02-05 17:53:05,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 17:53:05,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:05,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -721886701, now seen corresponding path program 1 times [2025-02-05 17:53:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936403353] [2025-02-05 17:53:05,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:05,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:53:05,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:53:05,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:05,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:05,899 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:53:05,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:05,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936403353] [2025-02-05 17:53:05,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936403353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:05,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:05,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:53:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883429192] [2025-02-05 17:53:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:05,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:53:05,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:05,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:53:05,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:53:05,901 INFO L87 Difference]: Start difference. First operand 30619 states and 60013 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:09,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:09,485 INFO L93 Difference]: Finished difference Result 96919 states and 216021 transitions. [2025-02-05 17:53:09,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:53:09,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:53:09,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:09,886 INFO L225 Difference]: With dead ends: 96919 [2025-02-05 17:53:09,887 INFO L226 Difference]: Without dead ends: 66313 [2025-02-05 17:53:09,989 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:53:09,990 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 465 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:09,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 1406 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:53:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66313 states. [2025-02-05 17:53:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66313 to 65012. [2025-02-05 17:53:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65012 states, 54327 states have (on average 1.5242328860419312) internal successors, (82807), 60635 states have internal predecessors, (82807), 2836 states have call successors, (2836), 1543 states have call predecessors, (2836), 7848 states have return successors, (68370), 3089 states have call predecessors, (68370), 2834 states have call successors, (68370) [2025-02-05 17:53:15,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65012 states to 65012 states and 154013 transitions. [2025-02-05 17:53:15,211 INFO L78 Accepts]: Start accepts. Automaton has 65012 states and 154013 transitions. Word has length 91 [2025-02-05 17:53:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:53:15,213 INFO L471 AbstractCegarLoop]: Abstraction has 65012 states and 154013 transitions. [2025-02-05 17:53:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 65012 states and 154013 transitions. [2025-02-05 17:53:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 17:53:15,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:53:15,241 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] [2025-02-05 17:53:15,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 17:53:15,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:53:15,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:53:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1329963564, now seen corresponding path program 1 times [2025-02-05 17:53:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:53:15,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151165258] [2025-02-05 17:53:15,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:53:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:53:15,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 17:53:15,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 17:53:15,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:53:15,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:53:15,292 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:53:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:53:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151165258] [2025-02-05 17:53:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151165258] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:53:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:53:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:53:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343084980] [2025-02-05 17:53:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:53:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:53:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:53:15,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:53:15,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:53:15,294 INFO L87 Difference]: Start difference. First operand 65012 states and 154013 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:53:21,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:53:21,496 INFO L93 Difference]: Finished difference Result 192433 states and 459686 transitions. [2025-02-05 17:53:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:53:21,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 91 [2025-02-05 17:53:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:53:22,491 INFO L225 Difference]: With dead ends: 192433 [2025-02-05 17:53:22,492 INFO L226 Difference]: Without dead ends: 127435 [2025-02-05 17:53:22,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:53:22,659 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 485 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:53:22,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 981 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:53:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127435 states.