./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:25:19,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:25:19,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:25:19,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:25:19,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:25:19,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:25:19,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:25:19,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:25:19,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:25:19,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:25:19,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:25:19,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:25:19,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:25:19,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:25:19,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:25:19,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:19,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:25:19,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:25:19,475 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/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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2025-03-08 05:25:19,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:25:19,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:25:19,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:25:19,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:25:19,681 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:25:19,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-03-08 05:25:20,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd9b9869/c55a10cc74df4fd3846ac1d3069d084e/FLAG9fae01fda [2025-03-08 05:25:21,159 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:25:21,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-03-08 05:25:21,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd9b9869/c55a10cc74df4fd3846ac1d3069d084e/FLAG9fae01fda [2025-03-08 05:25:21,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd9b9869/c55a10cc74df4fd3846ac1d3069d084e [2025-03-08 05:25:21,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:25:21,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:25:21,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:21,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:25:21,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:25:21,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:21,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ebf3fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21, skipping insertion in model container [2025-03-08 05:25:21,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:21,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:25:21,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c[28842,28855] [2025-03-08 05:25:21,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:21,807 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:25:21,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-08 05:25:21,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2025-03-08 05:25:21,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2025-03-08 05:25:21,816 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2025-03-08 05:25:21,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2025-03-08 05:25:21,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2025-03-08 05:25:21,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2025-03-08 05:25:21,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2025-03-08 05:25:21,817 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2025-03-08 05:25:21,818 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2025-03-08 05:25:21,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c[28842,28855] [2025-03-08 05:25:21,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:25:21,950 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:25:21,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21 WrapperNode [2025-03-08 05:25:21,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:25:21,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:21,953 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:25:21,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:25:21,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:21,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,017 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 808 [2025-03-08 05:25:22,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:25:22,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:25:22,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:25:22,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:25:22,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,057 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:25:22,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,080 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,090 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:25:22,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:25:22,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:25:22,091 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:25:22,095 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (1/1) ... [2025-03-08 05:25:22,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:25:22,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:25:22,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:25:22,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:25:22,137 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:25:22,137 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:25:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:25:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:25:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:25:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:25:22,138 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:25:22,138 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:25:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:25:22,139 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:25:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:25:22,139 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:25:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:25:22,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:25:22,139 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:25:22,139 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:25:22,270 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:25:22,272 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:25:22,313 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: #res := ~retValue_acc~4; [2025-03-08 05:25:22,318 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: #res := ~retValue_acc~10; [2025-03-08 05:25:22,618 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2190: #res := ~retValue_acc~18; [2025-03-08 05:25:22,678 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2294: #res := ~retValue_acc~21; [2025-03-08 05:25:22,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: #res := ~retValue_acc~3; [2025-03-08 05:25:22,743 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745-1: isEmpty_#res#1 := isEmpty_~retValue_acc~15#1; [2025-03-08 05:25:22,822 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-08 05:25:22,822 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-08 05:25:22,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-03-08 05:25:22,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-08 05:25:22,957 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-03-08 05:25:23,011 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: #res := ~retValue_acc~6; [2025-03-08 05:25:23,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L409-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-08 05:25:23,073 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1415-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-03-08 05:25:23,082 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: #res := ~retValue_acc~5; [2025-03-08 05:25:23,084 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662: #res := ~retValue_acc~12; [2025-03-08 05:25:23,087 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1380: #res := ~retValue_acc~7; [2025-03-08 05:25:23,180 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-03-08 05:25:23,180 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:25:23,201 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:25:23,201 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:25:23,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:23 BoogieIcfgContainer [2025-03-08 05:25:23,202 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:25:23,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:25:23,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:25:23,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:25:23,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:25:21" (1/3) ... [2025-03-08 05:25:23,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:23, skipping insertion in model container [2025-03-08 05:25:23,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:25:21" (2/3) ... [2025-03-08 05:25:23,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@599d5e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:25:23, skipping insertion in model container [2025-03-08 05:25:23,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:25:23" (3/3) ... [2025-03-08 05:25:23,208 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2025-03-08 05:25:23,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:25:23,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product09.cil.c that has 21 procedures, 524 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:25:23,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:25:23,286 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;@18803cda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:25:23,286 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:25:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 416 states have (on average 1.71875) internal successors, (715), 437 states have internal predecessors, (715), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 05:25:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:25:23,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:23,306 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] [2025-03-08 05:25:23,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:23,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 882702254, now seen corresponding path program 1 times [2025-03-08 05:25:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40869519] [2025-03-08 05:25:23,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:25:23,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:25:23,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:23,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:23,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40869519] [2025-03-08 05:25:23,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40869519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:23,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:23,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:23,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871370487] [2025-03-08 05:25:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:23,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:23,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:23,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:23,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:23,832 INFO L87 Difference]: Start difference. First operand has 524 states, 416 states have (on average 1.71875) internal successors, (715), 437 states have internal predecessors, (715), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:23,957 INFO L93 Difference]: Finished difference Result 1028 states and 1749 transitions. [2025-03-08 05:25:23,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:25:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:23,974 INFO L225 Difference]: With dead ends: 1028 [2025-03-08 05:25:23,974 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:25:23,980 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-03-08 05:25:23,983 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 5 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2597 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:23,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2597 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:25:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:25:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.7170731707317073) internal successors, (704), 429 states have internal predecessors, (704), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 871 transitions. [2025-03-08 05:25:24,047 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 871 transitions. Word has length 74 [2025-03-08 05:25:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:24,047 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 871 transitions. [2025-03-08 05:25:24,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 871 transitions. [2025-03-08 05:25:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:25:24,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:24,054 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] [2025-03-08 05:25:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:25:24,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:24,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash 330707407, now seen corresponding path program 1 times [2025-03-08 05:25:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008006643] [2025-03-08 05:25:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:24,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:25:24,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:25:24,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:24,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:24,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:24,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008006643] [2025-03-08 05:25:24,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008006643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:24,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:24,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249893280] [2025-03-08 05:25:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:24,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:24,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:24,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:24,230 INFO L87 Difference]: Start difference. First operand 516 states and 871 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:24,286 INFO L93 Difference]: Finished difference Result 1014 states and 1719 transitions. [2025-03-08 05:25:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:24,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-08 05:25:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:24,292 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 05:25:24,292 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:25:24,293 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-03-08 05:25:24,294 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 4 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:24,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2576 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:25:24,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:25:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.7146341463414634) internal successors, (703), 429 states have internal predecessors, (703), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 870 transitions. [2025-03-08 05:25:24,324 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 870 transitions. Word has length 76 [2025-03-08 05:25:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:24,324 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 870 transitions. [2025-03-08 05:25:24,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,324 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 870 transitions. [2025-03-08 05:25:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:25:24,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:24,327 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] [2025-03-08 05:25:24,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:25:24,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:24,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:24,328 INFO L85 PathProgramCache]: Analyzing trace with hash -649668770, now seen corresponding path program 1 times [2025-03-08 05:25:24,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:24,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995972803] [2025-03-08 05:25:24,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:24,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:24,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:25:24,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:25:24,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:24,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:24,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:24,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995972803] [2025-03-08 05:25:24,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995972803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:24,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:24,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:24,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256056739] [2025-03-08 05:25:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:24,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:24,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:24,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:24,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:24,488 INFO L87 Difference]: Start difference. First operand 516 states and 870 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:24,539 INFO L93 Difference]: Finished difference Result 1014 states and 1718 transitions. [2025-03-08 05:25:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:24,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-03-08 05:25:24,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:24,543 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 05:25:24,544 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:25:24,545 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-03-08 05:25:24,546 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 3 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:24,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:25:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:25:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.7121951219512195) internal successors, (702), 429 states have internal predecessors, (702), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 869 transitions. [2025-03-08 05:25:24,570 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 869 transitions. Word has length 77 [2025-03-08 05:25:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:24,571 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 869 transitions. [2025-03-08 05:25:24,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,571 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 869 transitions. [2025-03-08 05:25:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:25:24,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:24,574 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] [2025-03-08 05:25:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:25:24,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:24,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1130864590, now seen corresponding path program 1 times [2025-03-08 05:25:24,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:24,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470265518] [2025-03-08 05:25:24,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:24,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:24,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:25:24,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:25:24,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:24,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:24,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:24,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:24,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470265518] [2025-03-08 05:25:24,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470265518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:24,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:24,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:24,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128088228] [2025-03-08 05:25:24,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:24,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:24,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:24,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:24,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:24,694 INFO L87 Difference]: Start difference. First operand 516 states and 869 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:24,735 INFO L93 Difference]: Finished difference Result 1014 states and 1717 transitions. [2025-03-08 05:25:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:24,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-08 05:25:24,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:24,742 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 05:25:24,742 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:25:24,744 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-03-08 05:25:24,745 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 2 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:24,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2576 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:25:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:25:24,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.7097560975609756) internal successors, (701), 429 states have internal predecessors, (701), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:24,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 868 transitions. [2025-03-08 05:25:24,760 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 868 transitions. Word has length 78 [2025-03-08 05:25:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:24,760 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 868 transitions. [2025-03-08 05:25:24,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 868 transitions. [2025-03-08 05:25:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:25:24,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:24,763 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] [2025-03-08 05:25:24,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:25:24,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:24,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:24,763 INFO L85 PathProgramCache]: Analyzing trace with hash 977628769, now seen corresponding path program 1 times [2025-03-08 05:25:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:24,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955085516] [2025-03-08 05:25:24,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:24,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:25:24,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:25:24,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:24,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:24,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:24,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955085516] [2025-03-08 05:25:24,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955085516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:24,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389533352] [2025-03-08 05:25:24,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:24,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:24,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:24,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:24,883 INFO L87 Difference]: Start difference. First operand 516 states and 868 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:24,919 INFO L93 Difference]: Finished difference Result 1014 states and 1716 transitions. [2025-03-08 05:25:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:24,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-08 05:25:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:24,923 INFO L225 Difference]: With dead ends: 1014 [2025-03-08 05:25:24,923 INFO L226 Difference]: Without dead ends: 516 [2025-03-08 05:25:24,925 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-03-08 05:25:24,926 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 1 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:24,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2576 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:24,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-08 05:25:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-08 05:25:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 410 states have (on average 1.7073170731707317) internal successors, (700), 429 states have internal predecessors, (700), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 867 transitions. [2025-03-08 05:25:24,943 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 867 transitions. Word has length 79 [2025-03-08 05:25:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:24,943 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 867 transitions. [2025-03-08 05:25:24,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 867 transitions. [2025-03-08 05:25:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:25:24,946 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:24,946 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] [2025-03-08 05:25:24,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:25:24,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:24,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:24,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1762108053, now seen corresponding path program 1 times [2025-03-08 05:25:24,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:24,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316375816] [2025-03-08 05:25:24,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:24,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:24,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:25:24,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:25:24,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:24,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316375816] [2025-03-08 05:25:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316375816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:25,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702088463] [2025-03-08 05:25:25,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:25,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:25,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:25,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:25,139 INFO L87 Difference]: Start difference. First operand 516 states and 867 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:25,223 INFO L93 Difference]: Finished difference Result 980 states and 1648 transitions. [2025-03-08 05:25:25,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:25,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-08 05:25:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:25,229 INFO L225 Difference]: With dead ends: 980 [2025-03-08 05:25:25,229 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:25:25,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:25,233 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 91 mSDsluCounter, 4204 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5061 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:25,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5061 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:25:25,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 529. [2025-03-08 05:25:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 441 states have internal predecessors, (715), 87 states have call successors, (87), 20 states have call predecessors, (87), 21 states have return successors, (84), 80 states have call predecessors, (84), 82 states have call successors, (84) [2025-03-08 05:25:25,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 886 transitions. [2025-03-08 05:25:25,258 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 886 transitions. Word has length 80 [2025-03-08 05:25:25,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:25,258 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 886 transitions. [2025-03-08 05:25:25,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 886 transitions. [2025-03-08 05:25:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:25:25,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:25,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:25,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:25:25,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:25,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:25,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1553409750, now seen corresponding path program 1 times [2025-03-08 05:25:25,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:25,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684832442] [2025-03-08 05:25:25,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:25,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:25,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:25:25,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:25:25,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:25,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:25,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:25,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684832442] [2025-03-08 05:25:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684832442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:25,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:25,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406907044] [2025-03-08 05:25:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:25,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:25,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:25,354 INFO L87 Difference]: Start difference. First operand 529 states and 886 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:25,386 INFO L93 Difference]: Finished difference Result 1032 states and 1742 transitions. [2025-03-08 05:25:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:25,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-08 05:25:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:25,390 INFO L225 Difference]: With dead ends: 1032 [2025-03-08 05:25:25,390 INFO L226 Difference]: Without dead ends: 510 [2025-03-08 05:25:25,392 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-03-08 05:25:25,392 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 0 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:25,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2578 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-08 05:25:25,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-08 05:25:25,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 404 states have (on average 1.698019801980198) internal successors, (686), 423 states have internal predecessors, (686), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 853 transitions. [2025-03-08 05:25:25,406 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 853 transitions. Word has length 80 [2025-03-08 05:25:25,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:25,406 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 853 transitions. [2025-03-08 05:25:25,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:25,406 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 853 transitions. [2025-03-08 05:25:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:25:25,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:25,408 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] [2025-03-08 05:25:25,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:25:25,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1199248912, now seen corresponding path program 1 times [2025-03-08 05:25:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860126835] [2025-03-08 05:25:25,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:25,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:25:25,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:25:25,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:25,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:25,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:25,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860126835] [2025-03-08 05:25:25,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860126835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:25,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:25,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:25,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452058692] [2025-03-08 05:25:25,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:25,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:25,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:25,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:25,525 INFO L87 Difference]: Start difference. First operand 510 states and 853 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:25,678 INFO L93 Difference]: Finished difference Result 977 states and 1640 transitions. [2025-03-08 05:25:25,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:25,678 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-03-08 05:25:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:25,681 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:25:25,681 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 05:25:25,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:25,684 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 55 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:25,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4021 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:25,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 05:25:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 510. [2025-03-08 05:25:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 404 states have (on average 1.688118811881188) internal successors, (682), 423 states have internal predecessors, (682), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 849 transitions. [2025-03-08 05:25:25,698 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 849 transitions. Word has length 81 [2025-03-08 05:25:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:25,698 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 849 transitions. [2025-03-08 05:25:25,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 849 transitions. [2025-03-08 05:25:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:25:25,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:25,700 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] [2025-03-08 05:25:25,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:25:25,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:25,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:25,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1729012098, now seen corresponding path program 1 times [2025-03-08 05:25:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824897517] [2025-03-08 05:25:25,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:25,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:25:25,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:25:25,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824897517] [2025-03-08 05:25:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824897517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479992264] [2025-03-08 05:25:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:25,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:25,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:25,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:25,820 INFO L87 Difference]: Start difference. First operand 510 states and 849 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:25,955 INFO L93 Difference]: Finished difference Result 977 states and 1636 transitions. [2025-03-08 05:25:25,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:25,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2025-03-08 05:25:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:25,959 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:25:25,959 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 05:25:25,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:25,963 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 54 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:25,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4021 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 05:25:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 510. [2025-03-08 05:25:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 404 states have (on average 1.6782178217821782) internal successors, (678), 423 states have internal predecessors, (678), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 845 transitions. [2025-03-08 05:25:25,979 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 845 transitions. Word has length 82 [2025-03-08 05:25:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:25,979 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 845 transitions. [2025-03-08 05:25:25,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 845 transitions. [2025-03-08 05:25:25,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:25:25,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:25,982 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] [2025-03-08 05:25:25,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:25:25,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:25,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash 743597229, now seen corresponding path program 1 times [2025-03-08 05:25:25,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:25,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700993273] [2025-03-08 05:25:25,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:25,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:25,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:25:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:25:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:26,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:26,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700993273] [2025-03-08 05:25:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700993273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:26,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:26,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586184057] [2025-03-08 05:25:26,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:26,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:26,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:26,086 INFO L87 Difference]: Start difference. First operand 510 states and 845 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:26,210 INFO L93 Difference]: Finished difference Result 977 states and 1632 transitions. [2025-03-08 05:25:26,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-03-08 05:25:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:26,214 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:25:26,214 INFO L226 Difference]: Without dead ends: 519 [2025-03-08 05:25:26,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:26,216 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 53 mSDsluCounter, 3194 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4003 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:26,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4003 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-08 05:25:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 510. [2025-03-08 05:25:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 404 states have (on average 1.6683168316831682) internal successors, (674), 423 states have internal predecessors, (674), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 841 transitions. [2025-03-08 05:25:26,229 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 841 transitions. Word has length 83 [2025-03-08 05:25:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:26,230 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 841 transitions. [2025-03-08 05:25:26,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,230 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 841 transitions. [2025-03-08 05:25:26,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:25:26,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:26,232 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] [2025-03-08 05:25:26,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:25:26,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1717787490, now seen corresponding path program 1 times [2025-03-08 05:25:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:26,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121754768] [2025-03-08 05:25:26,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:26,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:25:26,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:25:26,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:26,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121754768] [2025-03-08 05:25:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121754768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:26,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77167653] [2025-03-08 05:25:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:26,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:26,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:26,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:26,340 INFO L87 Difference]: Start difference. First operand 510 states and 841 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:26,392 INFO L93 Difference]: Finished difference Result 968 states and 1614 transitions. [2025-03-08 05:25:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:26,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-03-08 05:25:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:26,396 INFO L225 Difference]: With dead ends: 968 [2025-03-08 05:25:26,396 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 05:25:26,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:26,398 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 84 mSDsluCounter, 4077 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4907 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:26,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4907 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 05:25:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-08 05:25:26,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 383 states have (on average 1.671018276762402) internal successors, (640), 402 states have internal predecessors, (640), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 807 transitions. [2025-03-08 05:25:26,411 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 807 transitions. Word has length 83 [2025-03-08 05:25:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 807 transitions. [2025-03-08 05:25:26,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:26,412 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 807 transitions. [2025-03-08 05:25:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:25:26,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:26,413 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] [2025-03-08 05:25:26,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:25:26,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1155504837, now seen corresponding path program 1 times [2025-03-08 05:25:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000869884] [2025-03-08 05:25:26,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:26,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:25:26,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:25:26,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000869884] [2025-03-08 05:25:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000869884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886585898] [2025-03-08 05:25:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:26,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:26,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:26,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:26,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:26,523 INFO L87 Difference]: Start difference. First operand 489 states and 807 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:26,588 INFO L93 Difference]: Finished difference Result 947 states and 1580 transitions. [2025-03-08 05:25:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:26,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-03-08 05:25:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:26,593 INFO L225 Difference]: With dead ends: 947 [2025-03-08 05:25:26,593 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 05:25:26,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:26,596 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 17 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:26,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3941 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 05:25:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-08 05:25:26,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 383 states have (on average 1.6684073107049608) internal successors, (639), 402 states have internal predecessors, (639), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 806 transitions. [2025-03-08 05:25:26,612 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 806 transitions. Word has length 84 [2025-03-08 05:25:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:26,612 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 806 transitions. [2025-03-08 05:25:26,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 806 transitions. [2025-03-08 05:25:26,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:25:26,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:26,615 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] [2025-03-08 05:25:26,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:25:26,615 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:26,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:26,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1138706614, now seen corresponding path program 1 times [2025-03-08 05:25:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:26,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774359507] [2025-03-08 05:25:26,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:26,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:25:26,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:25:26,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774359507] [2025-03-08 05:25:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774359507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693159108] [2025-03-08 05:25:26,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:26,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:26,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:26,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:26,729 INFO L87 Difference]: Start difference. First operand 489 states and 806 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:26,786 INFO L93 Difference]: Finished difference Result 947 states and 1579 transitions. [2025-03-08 05:25:26,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:25:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-08 05:25:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:26,790 INFO L225 Difference]: With dead ends: 947 [2025-03-08 05:25:26,790 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 05:25:26,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:26,792 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 16 mSDsluCounter, 3151 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3941 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:26,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3941 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:26,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 05:25:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-08 05:25:26,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 383 states have (on average 1.6657963446475197) internal successors, (638), 402 states have internal predecessors, (638), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 805 transitions. [2025-03-08 05:25:26,806 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 805 transitions. Word has length 85 [2025-03-08 05:25:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:26,806 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 805 transitions. [2025-03-08 05:25:26,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 805 transitions. [2025-03-08 05:25:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:25:26,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:26,808 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] [2025-03-08 05:25:26,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:25:26,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:26,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1838204201, now seen corresponding path program 1 times [2025-03-08 05:25:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:26,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909063899] [2025-03-08 05:25:26,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:26,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:25:26,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:25:26,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:26,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909063899] [2025-03-08 05:25:26,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909063899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:26,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:26,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:26,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101462672] [2025-03-08 05:25:26,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:26,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:26,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:26,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:26,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:26,874 INFO L87 Difference]: Start difference. First operand 489 states and 805 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:26,903 INFO L93 Difference]: Finished difference Result 947 states and 1578 transitions. [2025-03-08 05:25:26,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-03-08 05:25:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:26,908 INFO L225 Difference]: With dead ends: 947 [2025-03-08 05:25:26,908 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 05:25:26,909 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-03-08 05:25:26,910 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 9 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:26,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2388 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:26,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 05:25:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-08 05:25:26,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 383 states have (on average 1.6631853785900783) internal successors, (637), 402 states have internal predecessors, (637), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 804 transitions. [2025-03-08 05:25:26,940 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 804 transitions. Word has length 86 [2025-03-08 05:25:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:26,941 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 804 transitions. [2025-03-08 05:25:26,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 804 transitions. [2025-03-08 05:25:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:25:26,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:26,943 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] [2025-03-08 05:25:26,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:25:26,943 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:26,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:26,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1858541576, now seen corresponding path program 1 times [2025-03-08 05:25:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603089757] [2025-03-08 05:25:26,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:26,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:25:26,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:25:26,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:26,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603089757] [2025-03-08 05:25:27,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603089757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:27,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:27,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216154310] [2025-03-08 05:25:27,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:27,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:27,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:27,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:27,020 INFO L87 Difference]: Start difference. First operand 489 states and 804 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:27,053 INFO L93 Difference]: Finished difference Result 941 states and 1566 transitions. [2025-03-08 05:25:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:25:27,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2025-03-08 05:25:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:27,058 INFO L225 Difference]: With dead ends: 941 [2025-03-08 05:25:27,058 INFO L226 Difference]: Without dead ends: 489 [2025-03-08 05:25:27,061 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-03-08 05:25:27,061 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 4 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2367 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:27,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2367 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-08 05:25:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-08 05:25:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 383 states have (on average 1.6605744125326372) internal successors, (636), 402 states have internal predecessors, (636), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-08 05:25:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 803 transitions. [2025-03-08 05:25:27,074 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 803 transitions. Word has length 86 [2025-03-08 05:25:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:27,074 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 803 transitions. [2025-03-08 05:25:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:25:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 803 transitions. [2025-03-08 05:25:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:25:27,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:27,077 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] [2025-03-08 05:25:27,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:25:27,077 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:27,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -916453449, now seen corresponding path program 1 times [2025-03-08 05:25:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587013373] [2025-03-08 05:25:27,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:27,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:25:27,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:25:27,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:27,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587013373] [2025-03-08 05:25:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587013373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:27,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:27,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:27,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758119051] [2025-03-08 05:25:27,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:27,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:27,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:27,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:27,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:27,272 INFO L87 Difference]: Start difference. First operand 489 states and 803 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:28,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:28,563 INFO L93 Difference]: Finished difference Result 937 states and 1578 transitions. [2025-03-08 05:25:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:28,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 05:25:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:28,568 INFO L225 Difference]: With dead ends: 937 [2025-03-08 05:25:28,568 INFO L226 Difference]: Without dead ends: 493 [2025-03-08 05:25:28,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:25:28,571 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1238 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:28,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1579 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 05:25:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-03-08 05:25:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-03-08 05:25:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 386 states have (on average 1.6554404145077721) internal successors, (639), 405 states have internal predecessors, (639), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (97), 80 states have call predecessors, (97), 81 states have call successors, (97) [2025-03-08 05:25:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 822 transitions. [2025-03-08 05:25:28,589 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 822 transitions. Word has length 87 [2025-03-08 05:25:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:28,589 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 822 transitions. [2025-03-08 05:25:28,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:25:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 822 transitions. [2025-03-08 05:25:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:25:28,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:28,591 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] [2025-03-08 05:25:28,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:25:28,591 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:28,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:28,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1024388819, now seen corresponding path program 1 times [2025-03-08 05:25:28,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:28,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720279561] [2025-03-08 05:25:28,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:28,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:25:28,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:25:28,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:28,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:28,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720279561] [2025-03-08 05:25:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720279561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:28,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:28,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371418607] [2025-03-08 05:25:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:28,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:28,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:28,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:28,707 INFO L87 Difference]: Start difference. First operand 493 states and 822 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:31,200 INFO L93 Difference]: Finished difference Result 1760 states and 3034 transitions. [2025-03-08 05:25:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:25:31,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-03-08 05:25:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:31,208 INFO L225 Difference]: With dead ends: 1760 [2025-03-08 05:25:31,208 INFO L226 Difference]: Without dead ends: 1312 [2025-03-08 05:25:31,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:25:31,211 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 2231 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 4459 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 5023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:31,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 2570 Invalid, 5023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4459 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 05:25:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-08 05:25:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1255. [2025-03-08 05:25:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 980 states have (on average 1.6714285714285715) internal successors, (1638), 1028 states have internal predecessors, (1638), 223 states have call successors, (223), 51 states have call predecessors, (223), 51 states have return successors, (238), 212 states have call predecessors, (238), 218 states have call successors, (238) [2025-03-08 05:25:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2099 transitions. [2025-03-08 05:25:31,282 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2099 transitions. Word has length 88 [2025-03-08 05:25:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:31,282 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 2099 transitions. [2025-03-08 05:25:31,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:31,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2099 transitions. [2025-03-08 05:25:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:25:31,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:31,284 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] [2025-03-08 05:25:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:25:31,284 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:31,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:31,284 INFO L85 PathProgramCache]: Analyzing trace with hash -94940759, now seen corresponding path program 1 times [2025-03-08 05:25:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562075770] [2025-03-08 05:25:31,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:31,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:31,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:25:31,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:25:31,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:31,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:31,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:31,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562075770] [2025-03-08 05:25:31,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562075770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:31,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:31,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:31,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309675061] [2025-03-08 05:25:31,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:31,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:31,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:31,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:31,398 INFO L87 Difference]: Start difference. First operand 1255 states and 2099 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:34,094 INFO L93 Difference]: Finished difference Result 5952 states and 10283 transitions. [2025-03-08 05:25:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:25:34,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-08 05:25:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:34,122 INFO L225 Difference]: With dead ends: 5952 [2025-03-08 05:25:34,122 INFO L226 Difference]: Without dead ends: 4742 [2025-03-08 05:25:34,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:25:34,130 INFO L435 NwaCegarLoop]: 799 mSDtfsCounter, 2995 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 5065 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 5857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 5065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:34,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3124 Valid, 2825 Invalid, 5857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 5065 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:25:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4742 states. [2025-03-08 05:25:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4742 to 4217. [2025-03-08 05:25:34,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4217 states, 3123 states have (on average 1.6685878962536023) internal successors, (5211), 3335 states have internal predecessors, (5211), 940 states have call successors, (940), 137 states have call predecessors, (940), 153 states have return successors, (1134), 918 states have call predecessors, (1134), 935 states have call successors, (1134) [2025-03-08 05:25:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4217 states to 4217 states and 7285 transitions. [2025-03-08 05:25:34,347 INFO L78 Accepts]: Start accepts. Automaton has 4217 states and 7285 transitions. Word has length 90 [2025-03-08 05:25:34,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:34,348 INFO L471 AbstractCegarLoop]: Abstraction has 4217 states and 7285 transitions. [2025-03-08 05:25:34,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4217 states and 7285 transitions. [2025-03-08 05:25:34,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:25:34,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:34,350 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] [2025-03-08 05:25:34,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:25:34,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:34,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1124300057, now seen corresponding path program 1 times [2025-03-08 05:25:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167984791] [2025-03-08 05:25:34,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:34,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:25:34,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:25:34,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:34,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:34,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167984791] [2025-03-08 05:25:34,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167984791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:34,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:34,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44689694] [2025-03-08 05:25:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:34,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:34,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:34,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:34,458 INFO L87 Difference]: Start difference. First operand 4217 states and 7285 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:36,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:36,385 INFO L93 Difference]: Finished difference Result 11450 states and 19911 transitions. [2025-03-08 05:25:36,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:25:36,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-08 05:25:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:36,444 INFO L225 Difference]: With dead ends: 11450 [2025-03-08 05:25:36,445 INFO L226 Difference]: Without dead ends: 8382 [2025-03-08 05:25:36,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:25:36,465 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2282 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2359 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 3904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:36,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2359 Valid, 1693 Invalid, 3904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3429 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 05:25:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8382 states. [2025-03-08 05:25:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8382 to 7875. [2025-03-08 05:25:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7875 states, 5872 states have (on average 1.6665531335149864) internal successors, (9786), 6262 states have internal predecessors, (9786), 1690 states have call successors, (1690), 254 states have call predecessors, (1690), 312 states have return successors, (2163), 1649 states have call predecessors, (2163), 1685 states have call successors, (2163) [2025-03-08 05:25:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 13639 transitions. [2025-03-08 05:25:36,821 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 13639 transitions. Word has length 90 [2025-03-08 05:25:36,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:36,822 INFO L471 AbstractCegarLoop]: Abstraction has 7875 states and 13639 transitions. [2025-03-08 05:25:36,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:25:36,822 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 13639 transitions. [2025-03-08 05:25:36,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:25:36,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:36,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:36,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:25:36,824 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:36,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:36,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1194448559, now seen corresponding path program 1 times [2025-03-08 05:25:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835855207] [2025-03-08 05:25:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:36,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:25:36,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:25:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:36,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:36,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835855207] [2025-03-08 05:25:36,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835855207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:36,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:36,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:25:36,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506065475] [2025-03-08 05:25:36,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:36,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:25:36,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:36,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:25:36,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:25:36,988 INFO L87 Difference]: Start difference. First operand 7875 states and 13639 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:25:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:37,286 INFO L93 Difference]: Finished difference Result 14523 states and 25219 transitions. [2025-03-08 05:25:37,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-03-08 05:25:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:37,338 INFO L225 Difference]: With dead ends: 14523 [2025-03-08 05:25:37,338 INFO L226 Difference]: Without dead ends: 7962 [2025-03-08 05:25:37,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:25:37,366 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 0 mSDsluCounter, 2373 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3174 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:37,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3174 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7962 states. [2025-03-08 05:25:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7962 to 7948. [2025-03-08 05:25:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7948 states, 5928 states have (on average 1.6597503373819162) internal successors, (9839), 6317 states have internal predecessors, (9839), 1687 states have call successors, (1687), 254 states have call predecessors, (1687), 332 states have return successors, (2226), 1667 states have call predecessors, (2226), 1682 states have call successors, (2226) [2025-03-08 05:25:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7948 states to 7948 states and 13752 transitions. [2025-03-08 05:25:37,830 INFO L78 Accepts]: Start accepts. Automaton has 7948 states and 13752 transitions. Word has length 95 [2025-03-08 05:25:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:37,831 INFO L471 AbstractCegarLoop]: Abstraction has 7948 states and 13752 transitions. [2025-03-08 05:25:37,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:25:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7948 states and 13752 transitions. [2025-03-08 05:25:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:25:37,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:37,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:25:37,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:25:37,834 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:37,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 324084128, now seen corresponding path program 1 times [2025-03-08 05:25:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471621622] [2025-03-08 05:25:37,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:37,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:25:37,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:25:37,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:37,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:25:37,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:37,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471621622] [2025-03-08 05:25:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471621622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:37,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:37,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:25:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47185742] [2025-03-08 05:25:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:37,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:25:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:37,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:25:37,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:37,997 INFO L87 Difference]: Start difference. First operand 7948 states and 13752 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:25:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:38,500 INFO L93 Difference]: Finished difference Result 15749 states and 27692 transitions. [2025-03-08 05:25:38,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:38,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 102 [2025-03-08 05:25:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:38,547 INFO L225 Difference]: With dead ends: 15749 [2025-03-08 05:25:38,548 INFO L226 Difference]: Without dead ends: 8096 [2025-03-08 05:25:38,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:38,573 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 242 mSDsluCounter, 5592 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 6431 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:38,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 6431 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2025-03-08 05:25:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 7972. [2025-03-08 05:25:38,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7972 states, 5949 states have (on average 1.6372499579761304) internal successors, (9740), 6341 states have internal predecessors, (9740), 1687 states have call successors, (1687), 254 states have call predecessors, (1687), 335 states have return successors, (2238), 1667 states have call predecessors, (2238), 1682 states have call successors, (2238) [2025-03-08 05:25:38,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7972 states to 7972 states and 13665 transitions. [2025-03-08 05:25:38,910 INFO L78 Accepts]: Start accepts. Automaton has 7972 states and 13665 transitions. Word has length 102 [2025-03-08 05:25:38,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:38,910 INFO L471 AbstractCegarLoop]: Abstraction has 7972 states and 13665 transitions. [2025-03-08 05:25:38,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (10), 2 states have call predecessors, (10), 5 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-08 05:25:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7972 states and 13665 transitions. [2025-03-08 05:25:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:25:38,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:38,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:38,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:25:38,912 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:38,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:38,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1246305883, now seen corresponding path program 1 times [2025-03-08 05:25:38,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:38,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439442995] [2025-03-08 05:25:38,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:38,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:38,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:25:38,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:25:38,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:38,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:39,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:25:39,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:39,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439442995] [2025-03-08 05:25:39,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439442995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:39,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:39,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:25:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452152094] [2025-03-08 05:25:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:39,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:25:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:39,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:25:39,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:25:39,035 INFO L87 Difference]: Start difference. First operand 7972 states and 13665 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:25:40,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:40,742 INFO L93 Difference]: Finished difference Result 15352 states and 26357 transitions. [2025-03-08 05:25:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:25:40,743 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2025-03-08 05:25:40,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:40,796 INFO L225 Difference]: With dead ends: 15352 [2025-03-08 05:25:40,796 INFO L226 Difference]: Without dead ends: 8710 [2025-03-08 05:25:40,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:25:40,823 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 2004 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:40,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 1631 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 05:25:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2025-03-08 05:25:41,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 8207. [2025-03-08 05:25:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8207 states, 6124 states have (on average 1.6262246897452646) internal successors, (9959), 6534 states have internal predecessors, (9959), 1707 states have call successors, (1707), 279 states have call predecessors, (1707), 375 states have return successors, (2330), 1685 states have call predecessors, (2330), 1702 states have call successors, (2330) [2025-03-08 05:25:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8207 states to 8207 states and 13996 transitions. [2025-03-08 05:25:41,198 INFO L78 Accepts]: Start accepts. Automaton has 8207 states and 13996 transitions. Word has length 107 [2025-03-08 05:25:41,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:41,198 INFO L471 AbstractCegarLoop]: Abstraction has 8207 states and 13996 transitions. [2025-03-08 05:25:41,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:25:41,199 INFO L276 IsEmpty]: Start isEmpty. Operand 8207 states and 13996 transitions. [2025-03-08 05:25:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:25:41,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:41,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:41,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:25:41,202 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:41,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1494380823, now seen corresponding path program 1 times [2025-03-08 05:25:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:41,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535028276] [2025-03-08 05:25:41,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:41,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:25:41,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:25:41,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:41,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:25:41,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535028276] [2025-03-08 05:25:41,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535028276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:41,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 05:25:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391171615] [2025-03-08 05:25:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:41,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 05:25:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:41,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 05:25:41,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:25:41,453 INFO L87 Difference]: Start difference. First operand 8207 states and 13996 transitions. Second operand has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:25:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:44,497 INFO L93 Difference]: Finished difference Result 17527 states and 29627 transitions. [2025-03-08 05:25:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:25:44,497 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 114 [2025-03-08 05:25:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:44,535 INFO L225 Difference]: With dead ends: 17527 [2025-03-08 05:25:44,535 INFO L226 Difference]: Without dead ends: 10469 [2025-03-08 05:25:44,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2025-03-08 05:25:44,552 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 2873 mSDsluCounter, 3350 mSDsCounter, 0 mSdLazyCounter, 7030 mSolverCounterSat, 667 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 3738 SdHoareTripleChecker+Invalid, 7697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 7030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:44,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2956 Valid, 3738 Invalid, 7697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [667 Valid, 7030 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:25:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10469 states. [2025-03-08 05:25:44,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10469 to 9681. [2025-03-08 05:25:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9681 states, 7290 states have (on average 1.601920438957476) internal successors, (11678), 7759 states have internal predecessors, (11678), 1890 states have call successors, (1890), 366 states have call predecessors, (1890), 500 states have return successors, (2603), 1847 states have call predecessors, (2603), 1885 states have call successors, (2603) [2025-03-08 05:25:44,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9681 states to 9681 states and 16171 transitions. [2025-03-08 05:25:44,923 INFO L78 Accepts]: Start accepts. Automaton has 9681 states and 16171 transitions. Word has length 114 [2025-03-08 05:25:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:44,924 INFO L471 AbstractCegarLoop]: Abstraction has 9681 states and 16171 transitions. [2025-03-08 05:25:44,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-08 05:25:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9681 states and 16171 transitions. [2025-03-08 05:25:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 05:25:44,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:44,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:44,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:25:44,926 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:44,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:44,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1943077462, now seen corresponding path program 1 times [2025-03-08 05:25:44,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:44,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499865310] [2025-03-08 05:25:44,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:44,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:44,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 05:25:44,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 05:25:44,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:44,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:25:45,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:45,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499865310] [2025-03-08 05:25:45,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499865310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:45,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:45,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:45,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585819148] [2025-03-08 05:25:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:45,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:45,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:45,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:45,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:45,043 INFO L87 Difference]: Start difference. First operand 9681 states and 16171 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:45,544 INFO L93 Difference]: Finished difference Result 22709 states and 38028 transitions. [2025-03-08 05:25:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:25:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-08 05:25:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:45,616 INFO L225 Difference]: With dead ends: 22709 [2025-03-08 05:25:45,616 INFO L226 Difference]: Without dead ends: 14358 [2025-03-08 05:25:45,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:25:45,648 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 753 mSDsluCounter, 7206 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 8503 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:45,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 8503 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:25:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14358 states. [2025-03-08 05:25:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14358 to 12504. [2025-03-08 05:25:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12504 states, 9398 states have (on average 1.6157693126197064) internal successors, (15185), 10000 states have internal predecessors, (15185), 2498 states have call successors, (2498), 448 states have call predecessors, (2498), 607 states have return successors, (3379), 2465 states have call predecessors, (3379), 2493 states have call successors, (3379) [2025-03-08 05:25:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12504 states to 12504 states and 21062 transitions. [2025-03-08 05:25:46,191 INFO L78 Accepts]: Start accepts. Automaton has 12504 states and 21062 transitions. Word has length 114 [2025-03-08 05:25:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:46,192 INFO L471 AbstractCegarLoop]: Abstraction has 12504 states and 21062 transitions. [2025-03-08 05:25:46,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-08 05:25:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 12504 states and 21062 transitions. [2025-03-08 05:25:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:25:46,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:46,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:46,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:25:46,195 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:46,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1073864537, now seen corresponding path program 1 times [2025-03-08 05:25:46,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:46,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931717186] [2025-03-08 05:25:46,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:46,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:25:46,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:25:46,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:46,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:25:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931717186] [2025-03-08 05:25:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931717186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:25:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325400823] [2025-03-08 05:25:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:25:46,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:46,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:25:46,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:25:46,321 INFO L87 Difference]: Start difference. First operand 12504 states and 21062 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:25:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:46,975 INFO L93 Difference]: Finished difference Result 12628 states and 21283 transitions. [2025-03-08 05:25:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:46,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-08 05:25:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:47,052 INFO L225 Difference]: With dead ends: 12628 [2025-03-08 05:25:47,052 INFO L226 Difference]: Without dead ends: 12613 [2025-03-08 05:25:47,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:47,065 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 862 mSDsluCounter, 2028 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:47,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2811 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 05:25:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12613 states. [2025-03-08 05:25:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12613 to 12512. [2025-03-08 05:25:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12512 states, 9406 states have (on average 1.6152455879226026) internal successors, (15193), 10008 states have internal predecessors, (15193), 2498 states have call successors, (2498), 448 states have call predecessors, (2498), 607 states have return successors, (3379), 2465 states have call predecessors, (3379), 2493 states have call successors, (3379) [2025-03-08 05:25:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12512 states to 12512 states and 21070 transitions. [2025-03-08 05:25:47,997 INFO L78 Accepts]: Start accepts. Automaton has 12512 states and 21070 transitions. Word has length 112 [2025-03-08 05:25:47,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:47,998 INFO L471 AbstractCegarLoop]: Abstraction has 12512 states and 21070 transitions. [2025-03-08 05:25:47,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:25:47,998 INFO L276 IsEmpty]: Start isEmpty. Operand 12512 states and 21070 transitions. [2025-03-08 05:25:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:25:48,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:48,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:25:48,001 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash -629379033, now seen corresponding path program 1 times [2025-03-08 05:25:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:48,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708775008] [2025-03-08 05:25:48,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:48,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:48,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:25:48,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:25:48,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:48,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:25:48,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:48,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708775008] [2025-03-08 05:25:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708775008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:48,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:48,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:25:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326780012] [2025-03-08 05:25:48,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:48,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:25:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:48,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:25:48,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:25:48,215 INFO L87 Difference]: Start difference. First operand 12512 states and 21070 transitions. Second operand has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:48,827 INFO L93 Difference]: Finished difference Result 12527 states and 21088 transitions. [2025-03-08 05:25:48,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:25:48,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-03-08 05:25:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:48,895 INFO L225 Difference]: With dead ends: 12527 [2025-03-08 05:25:48,896 INFO L226 Difference]: Without dead ends: 12512 [2025-03-08 05:25:48,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:25:48,908 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 17 mSDsluCounter, 6238 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 7022 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:48,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 7022 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:25:48,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12512 states. [2025-03-08 05:25:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12512 to 12512. [2025-03-08 05:25:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12512 states, 9406 states have (on average 1.6143950669785243) internal successors, (15185), 10008 states have internal predecessors, (15185), 2498 states have call successors, (2498), 448 states have call predecessors, (2498), 607 states have return successors, (3379), 2465 states have call predecessors, (3379), 2493 states have call successors, (3379) [2025-03-08 05:25:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12512 states to 12512 states and 21062 transitions. [2025-03-08 05:25:49,450 INFO L78 Accepts]: Start accepts. Automaton has 12512 states and 21062 transitions. Word has length 120 [2025-03-08 05:25:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:49,451 INFO L471 AbstractCegarLoop]: Abstraction has 12512 states and 21062 transitions. [2025-03-08 05:25:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.88888888888889) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (14), 2 states have call predecessors, (14), 5 states have return successors, (13), 4 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-08 05:25:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 12512 states and 21062 transitions. [2025-03-08 05:25:49,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:25:49,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:49,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:49,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:25:49,455 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:49,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1643954297, now seen corresponding path program 1 times [2025-03-08 05:25:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444114898] [2025-03-08 05:25:49,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:49,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:49,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:25:49,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:25:49,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:49,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 05:25:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444114898] [2025-03-08 05:25:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444114898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:25:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017157683] [2025-03-08 05:25:49,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:49,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:25:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:49,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:25:49,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:25:49,624 INFO L87 Difference]: Start difference. First operand 12512 states and 21062 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:25:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:50,993 INFO L93 Difference]: Finished difference Result 25033 states and 42300 transitions. [2025-03-08 05:25:50,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:25:50,994 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2025-03-08 05:25:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:51,080 INFO L225 Difference]: With dead ends: 25033 [2025-03-08 05:25:51,080 INFO L226 Difference]: Without dead ends: 12578 [2025-03-08 05:25:51,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:25:51,128 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1183 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:51,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 1570 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:25:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12578 states. [2025-03-08 05:25:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12578 to 12512. [2025-03-08 05:25:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12512 states, 9406 states have (on average 1.6135445460344462) internal successors, (15177), 10008 states have internal predecessors, (15177), 2498 states have call successors, (2498), 448 states have call predecessors, (2498), 607 states have return successors, (3379), 2465 states have call predecessors, (3379), 2493 states have call successors, (3379) [2025-03-08 05:25:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12512 states to 12512 states and 21054 transitions. [2025-03-08 05:25:51,717 INFO L78 Accepts]: Start accepts. Automaton has 12512 states and 21054 transitions. Word has length 130 [2025-03-08 05:25:51,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:51,717 INFO L471 AbstractCegarLoop]: Abstraction has 12512 states and 21054 transitions. [2025-03-08 05:25:51,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:25:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 12512 states and 21054 transitions. [2025-03-08 05:25:51,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:25:51,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:51,721 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:51,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:25:51,721 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:51,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:51,722 INFO L85 PathProgramCache]: Analyzing trace with hash -138337371, now seen corresponding path program 1 times [2025-03-08 05:25:51,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:51,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656009552] [2025-03-08 05:25:51,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:51,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:25:51,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:25:51,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:51,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:25:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656009552] [2025-03-08 05:25:51,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656009552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:51,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:51,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:51,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696950449] [2025-03-08 05:25:51,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:51,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:51,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:51,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:51,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:51,814 INFO L87 Difference]: Start difference. First operand 12512 states and 21054 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:25:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:25:53,856 INFO L93 Difference]: Finished difference Result 41367 states and 71812 transitions. [2025-03-08 05:25:53,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:25:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 137 [2025-03-08 05:25:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:25:54,067 INFO L225 Difference]: With dead ends: 41367 [2025-03-08 05:25:54,067 INFO L226 Difference]: Without dead ends: 28900 [2025-03-08 05:25:54,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:25:54,136 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1777 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:25:54,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 919 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 05:25:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28900 states. [2025-03-08 05:25:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28900 to 28246. [2025-03-08 05:25:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28246 states, 20678 states have (on average 1.6078440855014993) internal successors, (33247), 22139 states have internal predecessors, (33247), 6291 states have call successors, (6291), 891 states have call predecessors, (6291), 1276 states have return successors, (9820), 6245 states have call predecessors, (9820), 6286 states have call successors, (9820) [2025-03-08 05:25:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28246 states to 28246 states and 49358 transitions. [2025-03-08 05:25:56,184 INFO L78 Accepts]: Start accepts. Automaton has 28246 states and 49358 transitions. Word has length 137 [2025-03-08 05:25:56,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:25:56,184 INFO L471 AbstractCegarLoop]: Abstraction has 28246 states and 49358 transitions. [2025-03-08 05:25:56,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:25:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 28246 states and 49358 transitions. [2025-03-08 05:25:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:25:56,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:25:56,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:25:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 05:25:56,189 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:25:56,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:25:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 448094413, now seen corresponding path program 1 times [2025-03-08 05:25:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:25:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363984943] [2025-03-08 05:25:56,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:25:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:25:56,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:25:56,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:25:56,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:25:56,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:25:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:25:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:25:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363984943] [2025-03-08 05:25:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363984943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:25:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:25:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:25:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898495453] [2025-03-08 05:25:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:25:56,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:25:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:25:56,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:25:56,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:25:56,290 INFO L87 Difference]: Start difference. First operand 28246 states and 49358 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:00,486 INFO L93 Difference]: Finished difference Result 95500 states and 174293 transitions. [2025-03-08 05:26:00,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:00,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 140 [2025-03-08 05:26:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:00,978 INFO L225 Difference]: With dead ends: 95500 [2025-03-08 05:26:00,978 INFO L226 Difference]: Without dead ends: 67299 [2025-03-08 05:26:01,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:01,113 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1773 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:01,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 880 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:26:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67299 states. [2025-03-08 05:26:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67299 to 65511. [2025-03-08 05:26:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65511 states, 46588 states have (on average 1.6000901519704644) internal successors, (74545), 50200 states have internal predecessors, (74545), 16223 states have call successors, (16223), 1777 states have call predecessors, (16223), 2699 states have return successors, (29690), 16181 states have call predecessors, (29690), 16218 states have call successors, (29690) [2025-03-08 05:26:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65511 states to 65511 states and 120458 transitions. [2025-03-08 05:26:05,880 INFO L78 Accepts]: Start accepts. Automaton has 65511 states and 120458 transitions. Word has length 140 [2025-03-08 05:26:05,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:05,881 INFO L471 AbstractCegarLoop]: Abstraction has 65511 states and 120458 transitions. [2025-03-08 05:26:05,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:05,881 INFO L276 IsEmpty]: Start isEmpty. Operand 65511 states and 120458 transitions. [2025-03-08 05:26:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:26:05,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:05,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 05:26:05,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 05:26:05,886 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:05,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:05,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1005858031, now seen corresponding path program 1 times [2025-03-08 05:26:05,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:05,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201196501] [2025-03-08 05:26:05,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:05,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:05,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:26:05,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:26:05,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:05,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:26:05,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:05,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201196501] [2025-03-08 05:26:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201196501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:05,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369579406] [2025-03-08 05:26:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:05,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:05,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:05,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:05,966 INFO L87 Difference]: Start difference. First operand 65511 states and 120458 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-08 05:26:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:16,791 INFO L93 Difference]: Finished difference Result 225719 states and 439931 transitions. [2025-03-08 05:26:16,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:16,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 141 [2025-03-08 05:26:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:18,519 INFO L225 Difference]: With dead ends: 225719 [2025-03-08 05:26:18,520 INFO L226 Difference]: Without dead ends: 160253 [2025-03-08 05:26:19,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:19,023 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1761 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1827 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:19,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1827 Valid, 877 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:26:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160253 states.