./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9d4bfafe2ee2b10c7451875462462bdbc63aaee25e1868c3faa4756fb5ebfc5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:36:16,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:36:16,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:36:16,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:36:16,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:36:16,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:36:16,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:36:16,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:36:16,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:36:16,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:36:16,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:36:16,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:36:16,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:36:16,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:16,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:36:16,910 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9d4bfafe2ee2b10c7451875462462bdbc63aaee25e1868c3faa4756fb5ebfc5 [2025-02-05 15:36:17,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:36:17,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:36:17,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:36:17,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:36:17,137 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:36:17,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c [2025-02-05 15:36:18,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aec478a66/60acc9303eb047c7b99dfc4212bcf336/FLAG0fa5bde54 [2025-02-05 15:36:18,581 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:36:18,582 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c [2025-02-05 15:36:18,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aec478a66/60acc9303eb047c7b99dfc4212bcf336/FLAG0fa5bde54 [2025-02-05 15:36:18,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aec478a66/60acc9303eb047c7b99dfc4212bcf336 [2025-02-05 15:36:18,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:36:18,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:36:18,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:18,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:36:18,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:36:18,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:18" (1/1) ... [2025-02-05 15:36:18,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5b741b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:18, skipping insertion in model container [2025-02-05 15:36:18,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:18" (1/1) ... [2025-02-05 15:36:18,876 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:36:19,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c[17414,17427] [2025-02-05 15:36:19,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:19,313 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:36:19,318 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2025-02-05 15:36:19,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [716] [2025-02-05 15:36:19,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [725] [2025-02-05 15:36:19,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [739] [2025-02-05 15:36:19,320 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2285] [2025-02-05 15:36:19,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2651] [2025-02-05 15:36:19,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3008] [2025-02-05 15:36:19,321 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3126] [2025-02-05 15:36:19,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [3217] [2025-02-05 15:36:19,322 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3398] [2025-02-05 15:36:19,345 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product29.cil.c[17414,17427] [2025-02-05 15:36:19,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:19,420 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:36:19,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19 WrapperNode [2025-02-05 15:36:19,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:19,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:19,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:36:19,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:36:19,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,493 INFO L138 Inliner]: procedures = 93, calls = 341, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 901 [2025-02-05 15:36:19,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:19,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:36:19,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:36:19,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:36:19,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,540 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-02-05 15:36:19,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,564 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:36:19,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:36:19,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:36:19,589 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:36:19,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (1/1) ... [2025-02-05 15:36:19,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:19,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:19,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:36:19,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:36:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:36:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:36:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:36:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:36:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:36:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:36:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:36:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:36:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:36:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:36:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:36:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:36:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:36:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:36:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:36:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:36:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:36:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:36:19,649 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:36:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:36:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:36:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:36:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:36:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:36:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:36:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:36:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:36:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:36:19,651 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:36:19,651 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:36:19,651 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:36:19,651 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:36:19,651 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:36:19,651 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:36:19,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:36:19,652 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:36:19,652 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:36:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:36:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:36:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:36:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:36:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:36:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:36:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:36:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:36:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:36:19,653 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:36:19,800 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:36:19,803 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:36:19,855 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3123: #res := ~retValue_acc~25; [2025-02-05 15:36:19,882 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: #res := ~retValue_acc~23; [2025-02-05 15:36:19,886 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L823: #res := ~retValue_acc~3; [2025-02-05 15:36:19,902 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1001: #res := ~retValue_acc~4; [2025-02-05 15:36:20,112 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1611-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~13#1; [2025-02-05 15:36:20,112 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1577: #res#1 := ~retValue_acc~12#1; [2025-02-05 15:36:20,179 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1709: #res := ~retValue_acc~16; [2025-02-05 15:36:20,190 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3084: #res := ~retValue_acc~24; [2025-02-05 15:36:20,325 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1538: #res := ~retValue_acc~11; [2025-02-05 15:36:20,335 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1044: #res := ~retValue_acc~6; [2025-02-05 15:36:20,390 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1093-1: isEmpty_#res#1 := isEmpty_~retValue_acc~8#1; [2025-02-05 15:36:20,532 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1695-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-02-05 15:36:20,532 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1667-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~14#1; [2025-02-05 15:36:20,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1173-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; [2025-02-05 15:36:20,599 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186-1: isIdle_#res#1 := isIdle_~retValue_acc~10#1; [2025-02-05 15:36:20,644 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L402: #res := ~retValue_acc~1; [2025-02-05 15:36:20,693 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430-1: valid_product_#res#1 := valid_product_~retValue_acc~27#1; [2025-02-05 15:36:20,693 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3005-1: main_#res#1 := main_~retValue_acc~22#1; [2025-02-05 15:36:20,702 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~0; [2025-02-05 15:36:20,704 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1010: #res := ~retValue_acc~5; [2025-02-05 15:36:20,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: #res := ~retValue_acc~2; [2025-02-05 15:36:20,843 INFO L? ?]: Removed 460 outVars from TransFormulas that were not future-live. [2025-02-05 15:36:20,844 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:36:20,859 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:36:20,859 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:36:20,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:20 BoogieIcfgContainer [2025-02-05 15:36:20,860 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:36:20,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:36:20,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:36:20,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:36:20,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:36:18" (1/3) ... [2025-02-05 15:36:20,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481c87d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:20, skipping insertion in model container [2025-02-05 15:36:20,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:19" (2/3) ... [2025-02-05 15:36:20,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481c87d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:20, skipping insertion in model container [2025-02-05 15:36:20,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:20" (3/3) ... [2025-02-05 15:36:20,871 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product29.cil.c [2025-02-05 15:36:20,881 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:36:20,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product29.cil.c that has 25 procedures, 572 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:36:20,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:36:20,950 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;@28d750ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:36:20,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:36:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 572 states, 450 states have (on average 1.6955555555555555) internal successors, (763), 472 states have internal predecessors, (763), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) [2025-02-05 15:36:20,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 15:36:20,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:20,975 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:20,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:20,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:20,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1946903932, now seen corresponding path program 1 times [2025-02-05 15:36:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:20,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498913206] [2025-02-05 15:36:20,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:21,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 15:36:21,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 15:36:21,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:21,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:21,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:21,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:21,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498913206] [2025-02-05 15:36:21,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498913206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:21,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:21,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:21,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304449505] [2025-02-05 15:36:21,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:21,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:21,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:21,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:21,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:21,507 INFO L87 Difference]: Start difference. First operand has 572 states, 450 states have (on average 1.6955555555555555) internal successors, (763), 472 states have internal predecessors, (763), 95 states have call successors, (95), 24 states have call predecessors, (95), 24 states have return successors, (95), 89 states have call predecessors, (95), 95 states have call successors, (95) Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:21,618 INFO L93 Difference]: Finished difference Result 1124 states and 1880 transitions. [2025-02-05 15:36:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:21,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-02-05 15:36:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:21,637 INFO L225 Difference]: With dead ends: 1124 [2025-02-05 15:36:21,637 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 15:36:21,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:21,648 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 5 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2795 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-02-05 15:36:21,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2795 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 15:36:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-02-05 15:36:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6891891891891893) internal successors, (750), 463 states have internal predecessors, (750), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:21,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 935 transitions. [2025-02-05 15:36:21,722 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 935 transitions. Word has length 106 [2025-02-05 15:36:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:21,722 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 935 transitions. [2025-02-05 15:36:21,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 935 transitions. [2025-02-05 15:36:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:36:21,730 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:21,731 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:21,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:36:21,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:21,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 387333083, now seen corresponding path program 1 times [2025-02-05 15:36:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:21,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778769419] [2025-02-05 15:36:21,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:21,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:36:21,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:36:21,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:21,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:21,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:21,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778769419] [2025-02-05 15:36:21,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778769419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:21,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:21,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707181851] [2025-02-05 15:36:21,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:21,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:21,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:21,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:21,947 INFO L87 Difference]: Start difference. First operand 563 states and 935 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:22,004 INFO L93 Difference]: Finished difference Result 1108 states and 1847 transitions. [2025-02-05 15:36:22,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:22,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-05 15:36:22,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:22,010 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 15:36:22,010 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 15:36:22,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,013 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 4 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2768 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-02-05 15:36:22,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2768 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:22,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 15:36:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-02-05 15:36:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.686936936936937) internal successors, (749), 463 states have internal predecessors, (749), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 934 transitions. [2025-02-05 15:36:22,048 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 934 transitions. Word has length 107 [2025-02-05 15:36:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:22,048 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 934 transitions. [2025-02-05 15:36:22,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 934 transitions. [2025-02-05 15:36:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:36:22,053 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,053 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:22,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:36:22,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1868331137, now seen corresponding path program 1 times [2025-02-05 15:36:22,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822897386] [2025-02-05 15:36:22,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:22,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:36:22,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:36:22,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822897386] [2025-02-05 15:36:22,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822897386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:22,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070623410] [2025-02-05 15:36:22,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:22,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:22,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:22,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,239 INFO L87 Difference]: Start difference. First operand 563 states and 934 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:22,303 INFO L93 Difference]: Finished difference Result 1108 states and 1846 transitions. [2025-02-05 15:36:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-02-05 15:36:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:22,310 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 15:36:22,310 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 15:36:22,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,314 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 3 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2768 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-02-05 15:36:22,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2768 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 15:36:22,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-02-05 15:36:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6846846846846846) internal successors, (748), 463 states have internal predecessors, (748), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 933 transitions. [2025-02-05 15:36:22,345 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 933 transitions. Word has length 108 [2025-02-05 15:36:22,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:22,345 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 933 transitions. [2025-02-05 15:36:22,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 933 transitions. [2025-02-05 15:36:22,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:36:22,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,351 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:22,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:36:22,351 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1626242120, now seen corresponding path program 1 times [2025-02-05 15:36:22,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705859429] [2025-02-05 15:36:22,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:22,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:36:22,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:36:22,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:22,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:22,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705859429] [2025-02-05 15:36:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705859429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:22,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:22,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:22,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230208597] [2025-02-05 15:36:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:22,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:22,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:22,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,530 INFO L87 Difference]: Start difference. First operand 563 states and 933 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:22,581 INFO L93 Difference]: Finished difference Result 1108 states and 1845 transitions. [2025-02-05 15:36:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:22,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-05 15:36:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:22,586 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 15:36:22,586 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 15:36:22,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,590 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 2 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2768 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-02-05 15:36:22,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2768 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 15:36:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-02-05 15:36:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6824324324324325) internal successors, (747), 463 states have internal predecessors, (747), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:22,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 932 transitions. [2025-02-05 15:36:22,613 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 932 transitions. Word has length 109 [2025-02-05 15:36:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:22,614 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 932 transitions. [2025-02-05 15:36:22,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 932 transitions. [2025-02-05 15:36:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:36:22,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,617 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:36:22,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -449736066, now seen corresponding path program 1 times [2025-02-05 15:36:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338033723] [2025-02-05 15:36:22,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:22,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:36:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:36:22,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:22,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338033723] [2025-02-05 15:36:22,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338033723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:22,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:22,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:22,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837346689] [2025-02-05 15:36:22,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:22,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:22,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:22,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:22,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,779 INFO L87 Difference]: Start difference. First operand 563 states and 932 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:22,815 INFO L93 Difference]: Finished difference Result 1108 states and 1844 transitions. [2025-02-05 15:36:22,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:22,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2025-02-05 15:36:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:22,819 INFO L225 Difference]: With dead ends: 1108 [2025-02-05 15:36:22,819 INFO L226 Difference]: Without dead ends: 563 [2025-02-05 15:36:22,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:22,822 INFO L435 NwaCegarLoop]: 924 mSDtfsCounter, 1 mSDsluCounter, 1844 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2768 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-02-05 15:36:22,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2768 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-02-05 15:36:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2025-02-05 15:36:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 444 states have (on average 1.6801801801801801) internal successors, (746), 463 states have internal predecessors, (746), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 931 transitions. [2025-02-05 15:36:22,859 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 931 transitions. Word has length 110 [2025-02-05 15:36:22,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:22,859 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 931 transitions. [2025-02-05 15:36:22,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 931 transitions. [2025-02-05 15:36:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:36:22,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:22,864 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:22,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:36:22,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:22,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash -498659435, now seen corresponding path program 1 times [2025-02-05 15:36:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:22,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294489192] [2025-02-05 15:36:22,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:22,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:22,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:36:22,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:36:22,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:22,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294489192] [2025-02-05 15:36:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294489192] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:23,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705083359] [2025-02-05 15:36:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:23,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:23,045 INFO L87 Difference]: Start difference. First operand 563 states and 931 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:23,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,128 INFO L93 Difference]: Finished difference Result 1074 states and 1776 transitions. [2025-02-05 15:36:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:23,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-02-05 15:36:23,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:23,133 INFO L225 Difference]: With dead ends: 1074 [2025-02-05 15:36:23,133 INFO L226 Difference]: Without dead ends: 578 [2025-02-05 15:36:23,135 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-02-05 15:36:23,137 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 91 mSDsluCounter, 4524 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5445 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-02-05 15:36:23,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5445 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-02-05 15:36:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 576. [2025-02-05 15:36:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 454 states have (on average 1.6762114537444934) internal successors, (761), 475 states have internal predecessors, (761), 96 states have call successors, (96), 24 states have call predecessors, (96), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2025-02-05 15:36:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 950 transitions. [2025-02-05 15:36:23,163 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 950 transitions. Word has length 111 [2025-02-05 15:36:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:23,166 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 950 transitions. [2025-02-05 15:36:23,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 950 transitions. [2025-02-05 15:36:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:36:23,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:23,171 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:23,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:36:23,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:23,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:23,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1308146892, now seen corresponding path program 1 times [2025-02-05 15:36:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759183662] [2025-02-05 15:36:23,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-05 15:36:23,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-05 15:36:23,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:23,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759183662] [2025-02-05 15:36:23,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759183662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:23,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978587522] [2025-02-05 15:36:23,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:23,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:23,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:23,293 INFO L87 Difference]: Start difference. First operand 576 states and 950 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,332 INFO L93 Difference]: Finished difference Result 1126 states and 1870 transitions. [2025-02-05 15:36:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2025-02-05 15:36:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:23,337 INFO L225 Difference]: With dead ends: 1126 [2025-02-05 15:36:23,337 INFO L226 Difference]: Without dead ends: 557 [2025-02-05 15:36:23,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:23,341 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 0 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2770 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-02-05 15:36:23,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2770 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-05 15:36:23,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-02-05 15:36:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6712328767123288) internal successors, (732), 457 states have internal predecessors, (732), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 917 transitions. [2025-02-05 15:36:23,360 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 917 transitions. Word has length 111 [2025-02-05 15:36:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:23,360 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 917 transitions. [2025-02-05 15:36:23,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 917 transitions. [2025-02-05 15:36:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:36:23,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:23,363 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:23,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:36:23,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:23,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:23,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1430693440, now seen corresponding path program 1 times [2025-02-05 15:36:23,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:23,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270042085] [2025-02-05 15:36:23,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:36:23,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:36:23,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:23,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270042085] [2025-02-05 15:36:23,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270042085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184000162] [2025-02-05 15:36:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:23,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:23,509 INFO L87 Difference]: Start difference. First operand 557 states and 917 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,671 INFO L93 Difference]: Finished difference Result 1071 states and 1768 transitions. [2025-02-05 15:36:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:23,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2025-02-05 15:36:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:23,676 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 15:36:23,676 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 15:36:23,678 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-02-05 15:36:23,678 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 55 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4341 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-02-05 15:36:23,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4341 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:23,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 15:36:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-02-05 15:36:23,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6621004566210045) internal successors, (728), 457 states have internal predecessors, (728), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 913 transitions. [2025-02-05 15:36:23,698 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 913 transitions. Word has length 112 [2025-02-05 15:36:23,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:23,698 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 913 transitions. [2025-02-05 15:36:23,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:23,698 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 913 transitions. [2025-02-05 15:36:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 15:36:23,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:23,701 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:23,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:36:23,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1507375284, now seen corresponding path program 1 times [2025-02-05 15:36:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529194229] [2025-02-05 15:36:23,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:23,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:23,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 15:36:23,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 15:36:23,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:23,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:23,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529194229] [2025-02-05 15:36:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529194229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:23,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:23,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:23,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082911056] [2025-02-05 15:36:23,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:23,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:23,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:23,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:23,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:23,851 INFO L87 Difference]: Start difference. First operand 557 states and 913 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:23,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:23,996 INFO L93 Difference]: Finished difference Result 1071 states and 1764 transitions. [2025-02-05 15:36:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:23,998 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), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-02-05 15:36:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,002 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 15:36:24,002 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 15:36:24,004 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-02-05 15:36:24,005 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 54 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4341 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-02-05 15:36:24,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4341 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 15:36:24,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-02-05 15:36:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.6529680365296804) internal successors, (724), 457 states have internal predecessors, (724), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 909 transitions. [2025-02-05 15:36:24,027 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 909 transitions. Word has length 113 [2025-02-05 15:36:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,028 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 909 transitions. [2025-02-05 15:36:24,028 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), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 909 transitions. [2025-02-05 15:36:24,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:36:24,031 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,031 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:24,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:36:24,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash 455846723, now seen corresponding path program 1 times [2025-02-05 15:36:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907088620] [2025-02-05 15:36:24,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:36:24,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:36:24,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:24,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907088620] [2025-02-05 15:36:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907088620] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:24,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538415799] [2025-02-05 15:36:24,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:24,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:24,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:24,176 INFO L87 Difference]: Start difference. First operand 557 states and 909 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:24,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,315 INFO L93 Difference]: Finished difference Result 1071 states and 1760 transitions. [2025-02-05 15:36:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:24,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-02-05 15:36:24,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,320 INFO L225 Difference]: With dead ends: 1071 [2025-02-05 15:36:24,321 INFO L226 Difference]: Without dead ends: 566 [2025-02-05 15:36:24,322 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-02-05 15:36:24,323 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 53 mSDsluCounter, 3450 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4323 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-02-05 15:36:24,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4323 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-02-05 15:36:24,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 557. [2025-02-05 15:36:24,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 438 states have (on average 1.643835616438356) internal successors, (720), 457 states have internal predecessors, (720), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 905 transitions. [2025-02-05 15:36:24,357 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 905 transitions. Word has length 114 [2025-02-05 15:36:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,357 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 905 transitions. [2025-02-05 15:36:24,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 905 transitions. [2025-02-05 15:36:24,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 15:36:24,360 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,360 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:24,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:36:24,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1715098318, now seen corresponding path program 1 times [2025-02-05 15:36:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193639414] [2025-02-05 15:36:24,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 15:36:24,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 15:36:24,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193639414] [2025-02-05 15:36:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193639414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553807354] [2025-02-05 15:36:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:24,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:24,526 INFO L87 Difference]: Start difference. First operand 557 states and 905 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,592 INFO L93 Difference]: Finished difference Result 1062 states and 1742 transitions. [2025-02-05 15:36:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:24,592 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2025-02-05 15:36:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,597 INFO L225 Difference]: With dead ends: 1062 [2025-02-05 15:36:24,597 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:36:24,600 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-02-05 15:36:24,600 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 84 mSDsluCounter, 4397 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5291 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-02-05 15:36:24,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5291 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:36:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:36:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.645083932853717) internal successors, (686), 436 states have internal predecessors, (686), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:24,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 871 transitions. [2025-02-05 15:36:24,618 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 871 transitions. Word has length 114 [2025-02-05 15:36:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,619 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 871 transitions. [2025-02-05 15:36:24,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:36:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 871 transitions. [2025-02-05 15:36:24,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 15:36:24,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,622 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:24,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:36:24,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,623 INFO L85 PathProgramCache]: Analyzing trace with hash -259741265, now seen corresponding path program 1 times [2025-02-05 15:36:24,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292803750] [2025-02-05 15:36:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 15:36:24,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 15:36:24,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292803750] [2025-02-05 15:36:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292803750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888318903] [2025-02-05 15:36:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:24,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:24,743 INFO L87 Difference]: Start difference. First operand 536 states and 871 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,808 INFO L93 Difference]: Finished difference Result 1041 states and 1708 transitions. [2025-02-05 15:36:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:24,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-02-05 15:36:24,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,814 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 15:36:24,814 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:36:24,817 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-02-05 15:36:24,818 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 17 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4261 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-02-05 15:36:24,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4261 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:36:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:36:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.6426858513189448) internal successors, (685), 436 states have internal predecessors, (685), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:24,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 870 transitions. [2025-02-05 15:36:24,837 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 870 transitions. Word has length 115 [2025-02-05 15:36:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,837 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 870 transitions. [2025-02-05 15:36:24,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 870 transitions. [2025-02-05 15:36:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:36:24,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,840 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:24,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:36:24,841 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1880906822, now seen corresponding path program 1 times [2025-02-05 15:36:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274133533] [2025-02-05 15:36:24,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:36:24,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:36:24,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:24,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274133533] [2025-02-05 15:36:24,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274133533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620945638] [2025-02-05 15:36:24,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:24,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:24,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:24,982 INFO L87 Difference]: Start difference. First operand 536 states and 870 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,037 INFO L93 Difference]: Finished difference Result 1041 states and 1707 transitions. [2025-02-05 15:36:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-02-05 15:36:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,042 INFO L225 Difference]: With dead ends: 1041 [2025-02-05 15:36:25,042 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:36:25,044 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-02-05 15:36:25,044 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 16 mSDsluCounter, 3407 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4261 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-02-05 15:36:25,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4261 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:36:25,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:36:25,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.6402877697841727) internal successors, (684), 436 states have internal predecessors, (684), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:25,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 869 transitions. [2025-02-05 15:36:25,059 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 869 transitions. Word has length 116 [2025-02-05 15:36:25,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,059 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 869 transitions. [2025-02-05 15:36:25,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,059 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 869 transitions. [2025-02-05 15:36:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 15:36:25,062 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,062 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:25,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:36:25,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1924407278, now seen corresponding path program 1 times [2025-02-05 15:36:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516708417] [2025-02-05 15:36:25,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 15:36:25,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 15:36:25,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:25,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516708417] [2025-02-05 15:36:25,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516708417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:25,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:25,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611188031] [2025-02-05 15:36:25,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:25,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:25,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:25,143 INFO L87 Difference]: Start difference. First operand 536 states and 869 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,175 INFO L93 Difference]: Finished difference Result 1035 states and 1695 transitions. [2025-02-05 15:36:25,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:25,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-02-05 15:36:25,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,180 INFO L225 Difference]: With dead ends: 1035 [2025-02-05 15:36:25,180 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 15:36:25,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:25,182 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 5 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2561 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-02-05 15:36:25,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2561 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 15:36:25,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 536. [2025-02-05 15:36:25,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 417 states have (on average 1.6378896882494005) internal successors, (683), 436 states have internal predecessors, (683), 95 states have call successors, (95), 24 states have call predecessors, (95), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2025-02-05 15:36:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 868 transitions. [2025-02-05 15:36:25,197 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 868 transitions. Word has length 117 [2025-02-05 15:36:25,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,197 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 868 transitions. [2025-02-05 15:36:25,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,197 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 868 transitions. [2025-02-05 15:36:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:36:25,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,200 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:25,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:36:25,200 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1681422983, now seen corresponding path program 1 times [2025-02-05 15:36:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934744307] [2025-02-05 15:36:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:25,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:25,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:25,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934744307] [2025-02-05 15:36:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934744307] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:25,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408863159] [2025-02-05 15:36:25,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:25,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:25,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:25,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:36:25,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:25,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:25,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:25,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:25,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:25,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:25,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408863159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:25,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:36:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442821640] [2025-02-05 15:36:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:36:25,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:36:25,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:25,744 INFO L87 Difference]: Start difference. First operand 536 states and 868 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,809 INFO L93 Difference]: Finished difference Result 1513 states and 2511 transitions. [2025-02-05 15:36:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:36:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:36:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,819 INFO L225 Difference]: With dead ends: 1513 [2025-02-05 15:36:25,819 INFO L226 Difference]: Without dead ends: 1022 [2025-02-05 15:36:25,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:25,824 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 808 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 2399 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2025-02-05 15:36:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 1002. [2025-02-05 15:36:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 783 states have (on average 1.6628352490421456) internal successors, (1302), 815 states have internal predecessors, (1302), 176 states have call successors, (176), 42 states have call predecessors, (176), 42 states have return successors, (177), 170 states have call predecessors, (177), 171 states have call successors, (177) [2025-02-05 15:36:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1655 transitions. [2025-02-05 15:36:25,868 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1655 transitions. Word has length 118 [2025-02-05 15:36:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,868 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1655 transitions. [2025-02-05 15:36:25,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1655 transitions. [2025-02-05 15:36:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 15:36:25,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,873 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:25,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:36:26,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:36:26,074 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:26,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2130119622, now seen corresponding path program 1 times [2025-02-05 15:36:26,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:26,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310821283] [2025-02-05 15:36:26,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:26,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:26,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:26,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:26,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:26,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:26,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310821283] [2025-02-05 15:36:26,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310821283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:26,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254295064] [2025-02-05 15:36:26,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:26,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:26,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:26,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:26,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:36:26,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 15:36:26,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 15:36:26,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:26,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:36:26,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:26,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:26,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254295064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:26,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:26,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:36:26,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542595851] [2025-02-05 15:36:26,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:26,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:26,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:26,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:26,699 INFO L87 Difference]: Start difference. First operand 1002 states and 1655 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:26,745 INFO L93 Difference]: Finished difference Result 1965 states and 3272 transitions. [2025-02-05 15:36:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:26,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-02-05 15:36:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:26,752 INFO L225 Difference]: With dead ends: 1965 [2025-02-05 15:36:26,753 INFO L226 Difference]: Without dead ends: 1008 [2025-02-05 15:36:26,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:36:26,758 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 0 mSDsluCounter, 2587 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3452 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:26,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3452 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:26,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2025-02-05 15:36:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2025-02-05 15:36:26,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 789 states have (on average 1.6577946768060836) internal successors, (1308), 821 states have internal predecessors, (1308), 176 states have call successors, (176), 42 states have call predecessors, (176), 42 states have return successors, (177), 170 states have call predecessors, (177), 171 states have call successors, (177) [2025-02-05 15:36:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1661 transitions. [2025-02-05 15:36:26,795 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1661 transitions. Word has length 118 [2025-02-05 15:36:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:26,796 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1661 transitions. [2025-02-05 15:36:26,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1661 transitions. [2025-02-05 15:36:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 15:36:26,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:26,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:26,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:36:27,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 15:36:27,004 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:27,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1120453678, now seen corresponding path program 1 times [2025-02-05 15:36:27,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:27,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757828406] [2025-02-05 15:36:27,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:27,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 15:36:27,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 15:36:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:27,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:27,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:27,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757828406] [2025-02-05 15:36:27,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757828406] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:27,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:27,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361927120] [2025-02-05 15:36:27,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:27,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:27,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:27,135 INFO L87 Difference]: Start difference. First operand 1008 states and 1661 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:29,783 INFO L93 Difference]: Finished difference Result 3579 states and 6072 transitions. [2025-02-05 15:36:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 121 [2025-02-05 15:36:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:29,802 INFO L225 Difference]: With dead ends: 3579 [2025-02-05 15:36:29,802 INFO L226 Difference]: Without dead ends: 2616 [2025-02-05 15:36:29,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:29,809 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 3435 mSDsluCounter, 1316 mSDsCounter, 0 mSdLazyCounter, 3442 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3477 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 4467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 3442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:29,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3477 Valid, 2189 Invalid, 4467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 3442 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 15:36:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2025-02-05 15:36:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2537. [2025-02-05 15:36:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 1870 states have (on average 1.6368983957219252) internal successors, (3061), 1980 states have internal predecessors, (3061), 572 states have call successors, (572), 79 states have call predecessors, (572), 94 states have return successors, (656), 571 states have call predecessors, (656), 567 states have call successors, (656) [2025-02-05 15:36:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4289 transitions. [2025-02-05 15:36:29,930 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4289 transitions. Word has length 121 [2025-02-05 15:36:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:29,930 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4289 transitions. [2025-02-05 15:36:29,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4289 transitions. [2025-02-05 15:36:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-05 15:36:29,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:29,934 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:29,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:36:29,934 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:29,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:29,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1825043755, now seen corresponding path program 1 times [2025-02-05 15:36:29,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946410543] [2025-02-05 15:36:29,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:29,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:29,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-05 15:36:29,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-05 15:36:29,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:29,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:30,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:30,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946410543] [2025-02-05 15:36:30,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946410543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:30,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:30,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:30,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591859474] [2025-02-05 15:36:30,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:30,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:30,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:30,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:30,073 INFO L87 Difference]: Start difference. First operand 2537 states and 4289 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:32,534 INFO L93 Difference]: Finished difference Result 10325 states and 17980 transitions. [2025-02-05 15:36:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:32,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 122 [2025-02-05 15:36:32,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:32,588 INFO L225 Difference]: With dead ends: 10325 [2025-02-05 15:36:32,589 INFO L226 Difference]: Without dead ends: 7834 [2025-02-05 15:36:32,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:32,607 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 3448 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 3409 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3491 SdHoareTripleChecker+Valid, 2202 SdHoareTripleChecker+Invalid, 4455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 3409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:32,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3491 Valid, 2202 Invalid, 4455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 3409 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 15:36:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2025-02-05 15:36:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 6425. [2025-02-05 15:36:32,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6425 states, 4488 states have (on average 1.6174242424242424) internal successors, (7259), 4810 states have internal predecessors, (7259), 1728 states have call successors, (1728), 153 states have call predecessors, (1728), 208 states have return successors, (2170), 1749 states have call predecessors, (2170), 1723 states have call successors, (2170) [2025-02-05 15:36:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 11157 transitions. [2025-02-05 15:36:32,970 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 11157 transitions. Word has length 122 [2025-02-05 15:36:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:32,970 INFO L471 AbstractCegarLoop]: Abstraction has 6425 states and 11157 transitions. [2025-02-05 15:36:32,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 11157 transitions. [2025-02-05 15:36:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:36:32,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:32,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:32,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:36:32,975 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:32,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:32,975 INFO L85 PathProgramCache]: Analyzing trace with hash 148998963, now seen corresponding path program 1 times [2025-02-05 15:36:32,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:32,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621523908] [2025-02-05 15:36:32,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:32,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:32,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:36:33,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:36:33,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:33,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:33,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:33,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:33,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621523908] [2025-02-05 15:36:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621523908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:33,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824762997] [2025-02-05 15:36:33,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:33,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:33,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:33,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:33,092 INFO L87 Difference]: Start difference. First operand 6425 states and 11157 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:36,087 INFO L93 Difference]: Finished difference Result 28449 states and 50896 transitions. [2025-02-05 15:36:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:36,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 123 [2025-02-05 15:36:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:36,276 INFO L225 Difference]: With dead ends: 28449 [2025-02-05 15:36:36,276 INFO L226 Difference]: Without dead ends: 22072 [2025-02-05 15:36:36,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:36,309 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 3460 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 3414 mSolverCounterSat, 1050 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3504 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 4464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1050 IncrementalHoareTripleChecker+Valid, 3414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:36,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3504 Valid, 2223 Invalid, 4464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1050 Valid, 3414 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 15:36:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22072 states. [2025-02-05 15:36:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22072 to 17787. [2025-02-05 15:36:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17787 states, 11842 states have (on average 1.5984630974497551) internal successors, (18929), 12798 states have internal predecessors, (18929), 5456 states have call successors, (5456), 301 states have call predecessors, (5456), 488 states have return successors, (7402), 5569 states have call predecessors, (7402), 5451 states have call successors, (7402) [2025-02-05 15:36:37,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17787 states to 17787 states and 31787 transitions. [2025-02-05 15:36:37,555 INFO L78 Accepts]: Start accepts. Automaton has 17787 states and 31787 transitions. Word has length 123 [2025-02-05 15:36:37,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:37,556 INFO L471 AbstractCegarLoop]: Abstraction has 17787 states and 31787 transitions. [2025-02-05 15:36:37,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 17787 states and 31787 transitions. [2025-02-05 15:36:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:36:37,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:37,562 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:37,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:36:37,562 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:37,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:37,563 INFO L85 PathProgramCache]: Analyzing trace with hash 9963706, now seen corresponding path program 1 times [2025-02-05 15:36:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:37,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408050082] [2025-02-05 15:36:37,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:37,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:36:37,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:36:37,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:37,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:37,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:37,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408050082] [2025-02-05 15:36:37,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408050082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:37,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:37,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:37,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072616655] [2025-02-05 15:36:37,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:37,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:37,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:37,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:37,678 INFO L87 Difference]: Start difference. First operand 17787 states and 31787 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:42,740 INFO L93 Difference]: Finished difference Result 84765 states and 155452 transitions. [2025-02-05 15:36:42,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:42,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 124 [2025-02-05 15:36:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:43,157 INFO L225 Difference]: With dead ends: 84765 [2025-02-05 15:36:43,158 INFO L226 Difference]: Without dead ends: 67030 [2025-02-05 15:36:43,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:43,259 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 3472 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 1052 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3517 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 4475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1052 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:43,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3517 Valid, 2244 Invalid, 4475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1052 Valid, 3423 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 15:36:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67030 states. [2025-02-05 15:36:46,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67030 to 53961. [2025-02-05 15:36:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53961 states, 34672 states have (on average 1.5840736040609138) internal successors, (54923), 37622 states have internal predecessors, (54923), 18040 states have call successors, (18040), 597 states have call predecessors, (18040), 1248 states have return successors, (26150), 18529 states have call predecessors, (26150), 18035 states have call successors, (26150) [2025-02-05 15:36:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53961 states to 53961 states and 99113 transitions. [2025-02-05 15:36:47,496 INFO L78 Accepts]: Start accepts. Automaton has 53961 states and 99113 transitions. Word has length 124 [2025-02-05 15:36:47,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:47,497 INFO L471 AbstractCegarLoop]: Abstraction has 53961 states and 99113 transitions. [2025-02-05 15:36:47,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:36:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 53961 states and 99113 transitions. [2025-02-05 15:36:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 15:36:47,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:47,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:47,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:36:47,504 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:47,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1209979336, now seen corresponding path program 1 times [2025-02-05 15:36:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:47,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822817948] [2025-02-05 15:36:47,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:47,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:47,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 15:36:47,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 15:36:47,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:47,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:36:47,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:47,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822817948] [2025-02-05 15:36:47,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822817948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:47,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:47,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:47,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960326710] [2025-02-05 15:36:47,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:47,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:47,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:47,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:47,610 INFO L87 Difference]: Start difference. First operand 53961 states and 99113 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-02-05 15:37:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:01,150 INFO L93 Difference]: Finished difference Result 272081 states and 509116 transitions. [2025-02-05 15:37:01,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:01,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 125 [2025-02-05 15:37:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:02,741 INFO L225 Difference]: With dead ends: 272081 [2025-02-05 15:37:02,741 INFO L226 Difference]: Without dead ends: 218180 [2025-02-05 15:37:03,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:03,174 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 3484 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 3432 mSolverCounterSat, 1054 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3530 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 4486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1054 IncrementalHoareTripleChecker+Valid, 3432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:03,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3530 Valid, 2265 Invalid, 4486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1054 Valid, 3432 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 15:37:03,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218180 states.