./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product24.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_spec3_product24.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 8333bf118d61dc3e3ddedc658c9d6fef28fa288c9b6abdc361c7a0f5f6e109b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:37:43,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:37:43,559 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:37:43,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:37:43,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:37:43,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:37:43,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:37:43,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:37:43,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:37:43,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:37:43,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:37:43,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:37:43,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:37:43,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:43,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:37:43,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:37:43,581 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 -> 8333bf118d61dc3e3ddedc658c9d6fef28fa288c9b6abdc361c7a0f5f6e109b7 [2025-02-05 15:37:43,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:37:43,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:37:43,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:37:43,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:37:43,811 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:37:43,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product24.cil.c [2025-02-05 15:37:44,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05fbda95e/cb8b24d183424131ab66a2e70e426770/FLAG89141eec0 [2025-02-05 15:37:45,285 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:37:45,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product24.cil.c [2025-02-05 15:37:45,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05fbda95e/cb8b24d183424131ab66a2e70e426770/FLAG89141eec0 [2025-02-05 15:37:45,326 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/05fbda95e/cb8b24d183424131ab66a2e70e426770 [2025-02-05 15:37:45,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:37:45,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:37:45,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:45,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:37:45,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:37:45,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d995cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45, skipping insertion in model container [2025-02-05 15:37:45,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:37:45,749 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_spec3_product24.cil.c[75121,75134] [2025-02-05 15:37:45,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:45,760 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:37:45,766 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-02-05 15:37:45,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [67] [2025-02-05 15:37:45,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [425] [2025-02-05 15:37:45,767 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [545] [2025-02-05 15:37:45,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [641] [2025-02-05 15:37:45,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2290] [2025-02-05 15:37:45,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2951] [2025-02-05 15:37:45,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3138] [2025-02-05 15:37:45,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3504] [2025-02-05 15:37:45,768 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3539] [2025-02-05 15:37:45,857 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_spec3_product24.cil.c[75121,75134] [2025-02-05 15:37:45,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:45,880 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:37:45,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45 WrapperNode [2025-02-05 15:37:45,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:45,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:45,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:37:45,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:37:45,887 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:37:45" (1/1) ... [2025-02-05 15:37:45,912 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:37:45" (1/1) ... [2025-02-05 15:37:45,959 INFO L138 Inliner]: procedures = 96, calls = 359, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 962 [2025-02-05 15:37:45,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:45,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:37:45,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:37:45,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:37:45,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,998 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:37:45,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:45,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:46,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:46,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:46,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:46,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:46,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:37:46,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:37:46,023 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:37:46,023 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:37:46,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (1/1) ... [2025-02-05 15:37:46,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:46,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:46,050 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:37:46,053 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:37:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:37:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:37:46,070 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:37:46,071 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:37:46,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:37:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:37:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:37:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:37:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:37:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:37:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:37:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:37:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:37:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-02-05 15:37:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:37:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:37:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:37:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:37:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2025-02-05 15:37:46,074 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2025-02-05 15:37:46,237 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:37:46,240 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:37:46,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1600: #res#1 := ~retValue_acc~18#1; [2025-02-05 15:37:46,294 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1572-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~17#1; [2025-02-05 15:37:46,299 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L928: #res := ~retValue_acc~9; [2025-02-05 15:37:46,317 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L464: #res := ~retValue_acc~2; [2025-02-05 15:37:46,347 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2278: #res := ~retValue_acc~22; [2025-02-05 15:37:46,400 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1516-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~16#1; [2025-02-05 15:37:46,400 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453-1: stopRequestedInDirection__wrappee__twothirdsfull_#res#1 := stopRequestedInDirection__wrappee__twothirdsfull_~retValue_acc~14#1; [2025-02-05 15:37:46,400 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1482: #res#1 := ~retValue_acc~15#1; [2025-02-05 15:37:46,414 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1645: #res := ~retValue_acc~20; [2025-02-05 15:37:46,497 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L885-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~7#1; [2025-02-05 15:37:46,545 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1048-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-02-05 15:37:46,545 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1061-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-02-05 15:37:46,549 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2948: #res := ~retValue_acc~26; [2025-02-05 15:37:46,559 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: #res := ~retValue_acc~4; [2025-02-05 15:37:46,561 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: #res := ~retValue_acc~5; [2025-02-05 15:37:46,562 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L876: #res := ~retValue_acc~6; [2025-02-05 15:37:46,704 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: #res := ~retValue_acc~3; [2025-02-05 15:37:46,726 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L919: #res := ~retValue_acc~8; [2025-02-05 15:37:46,794 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2637: #res := ~retValue_acc~25; [2025-02-05 15:37:46,886 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1413: #res := ~retValue_acc~13; [2025-02-05 15:37:46,936 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L422-1: main_#res#1 := main_~retValue_acc~1#1; [2025-02-05 15:37:46,937 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3536-1: valid_product_#res#1 := valid_product_~retValue_acc~31#1; [2025-02-05 15:37:46,945 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2401: #res := ~retValue_acc~24; [2025-02-05 15:37:47,017 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1631-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~19#1; [2025-02-05 15:37:47,156 INFO L? ?]: Removed 485 outVars from TransFormulas that were not future-live. [2025-02-05 15:37:47,157 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:37:47,179 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:37:47,179 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:37:47,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:47 BoogieIcfgContainer [2025-02-05 15:37:47,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:37:47,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:37:47,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:37:47,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:37:47,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:37:45" (1/3) ... [2025-02-05 15:37:47,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1b2e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:47, skipping insertion in model container [2025-02-05 15:37:47,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:45" (2/3) ... [2025-02-05 15:37:47,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1b2e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:47, skipping insertion in model container [2025-02-05 15:37:47,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:47" (3/3) ... [2025-02-05 15:37:47,191 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product24.cil.c [2025-02-05 15:37:47,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:37:47,205 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product24.cil.c that has 30 procedures, 620 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:37:47,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:37:47,269 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;@3f413b37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:37:47,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:37:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 620 states, 473 states have (on average 1.657505285412262) internal successors, (784), 494 states have internal predecessors, (784), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-05 15:37:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:37:47,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:47,280 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] [2025-02-05 15:37:47,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:47,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1682411385, now seen corresponding path program 1 times [2025-02-05 15:37:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136609579] [2025-02-05 15:37:47,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:47,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:37:47,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:37:47,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:47,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:47,814 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:37:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:47,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136609579] [2025-02-05 15:37:47,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136609579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:47,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:47,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272434368] [2025-02-05 15:37:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:47,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:47,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:47,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:47,843 INFO L87 Difference]: Start difference. First operand has 620 states, 473 states have (on average 1.657505285412262) internal successors, (784), 494 states have internal predecessors, (784), 115 states have call successors, (115), 29 states have call predecessors, (115), 29 states have return successors, (115), 111 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,036 INFO L93 Difference]: Finished difference Result 1237 states and 2040 transitions. [2025-02-05 15:37:48,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:48,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-02-05 15:37:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,056 INFO L225 Difference]: With dead ends: 1237 [2025-02-05 15:37:48,056 INFO L226 Difference]: Without dead ends: 624 [2025-02-05 15:37:48,064 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:37:48,066 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 91 mSDsluCounter, 4905 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5903 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:48,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5903 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-05 15:37:48,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 622. [2025-02-05 15:37:48,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 476 states have (on average 1.6512605042016806) internal successors, (786), 496 states have internal predecessors, (786), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-02-05 15:37:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1017 transitions. [2025-02-05 15:37:48,154 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1017 transitions. Word has length 67 [2025-02-05 15:37:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:48,155 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 1017 transitions. [2025-02-05 15:37:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1017 transitions. [2025-02-05 15:37:48,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:37:48,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:48,161 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] [2025-02-05 15:37:48,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:37:48,161 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:48,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1192345766, now seen corresponding path program 1 times [2025-02-05 15:37:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:48,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236967874] [2025-02-05 15:37:48,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:48,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:37:48,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:37:48,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:48,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:48,426 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:37:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236967874] [2025-02-05 15:37:48,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236967874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:48,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:48,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696072658] [2025-02-05 15:37:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:48,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:48,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:48,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:48,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:48,428 INFO L87 Difference]: Start difference. First operand 622 states and 1017 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,540 INFO L93 Difference]: Finished difference Result 1239 states and 2037 transitions. [2025-02-05 15:37:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:48,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-02-05 15:37:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,548 INFO L225 Difference]: With dead ends: 1239 [2025-02-05 15:37:48,548 INFO L226 Difference]: Without dead ends: 633 [2025-02-05 15:37:48,551 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:37:48,552 INFO L435 NwaCegarLoop]: 999 mSDtfsCounter, 90 mSDsluCounter, 4899 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5898 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:48,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5898 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-02-05 15:37:48,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 622. [2025-02-05 15:37:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 476 states have (on average 1.6512605042016806) internal successors, (786), 496 states have internal predecessors, (786), 116 states have call successors, (116), 29 states have call predecessors, (116), 29 states have return successors, (115), 110 states have call predecessors, (115), 113 states have call successors, (115) [2025-02-05 15:37:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1017 transitions. [2025-02-05 15:37:48,589 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1017 transitions. Word has length 68 [2025-02-05 15:37:48,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:48,589 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 1017 transitions. [2025-02-05 15:37:48,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:48,589 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1017 transitions. [2025-02-05 15:37:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:37:48,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:48,592 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] [2025-02-05 15:37:48,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:37:48,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:48,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:48,594 INFO L85 PathProgramCache]: Analyzing trace with hash -464887103, now seen corresponding path program 1 times [2025-02-05 15:37:48,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633246692] [2025-02-05 15:37:48,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:48,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:37:48,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:37:48,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:48,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:48,718 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:37:48,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:48,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633246692] [2025-02-05 15:37:48,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633246692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:48,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:48,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256292312] [2025-02-05 15:37:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:48,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:48,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:48,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:48,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:48,720 INFO L87 Difference]: Start difference. First operand 622 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:48,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:48,773 INFO L93 Difference]: Finished difference Result 1226 states and 2015 transitions. [2025-02-05 15:37:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-02-05 15:37:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:48,778 INFO L225 Difference]: With dead ends: 1226 [2025-02-05 15:37:48,778 INFO L226 Difference]: Without dead ends: 592 [2025-02-05 15:37:48,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:48,783 INFO L435 NwaCegarLoop]: 987 mSDtfsCounter, 14 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2956 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:48,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2956 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-02-05 15:37:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2025-02-05 15:37:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 449 states have (on average 1.6347438752783965) internal successors, (734), 467 states have internal predecessors, (734), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 961 transitions. [2025-02-05 15:37:48,813 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 961 transitions. Word has length 68 [2025-02-05 15:37:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:48,814 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 961 transitions. [2025-02-05 15:37:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:48,815 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 961 transitions. [2025-02-05 15:37:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 15:37:48,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:48,815 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] [2025-02-05 15:37:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:37:48,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -309931661, now seen corresponding path program 1 times [2025-02-05 15:37:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951581462] [2025-02-05 15:37:48,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 15:37:48,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 15:37:48,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:48,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,003 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:37:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951581462] [2025-02-05 15:37:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951581462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009310621] [2025-02-05 15:37:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:49,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:49,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:49,006 INFO L87 Difference]: Start difference. First operand 592 states and 961 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:49,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,078 INFO L93 Difference]: Finished difference Result 1177 states and 1921 transitions. [2025-02-05 15:37:49,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:49,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-02-05 15:37:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,084 INFO L225 Difference]: With dead ends: 1177 [2025-02-05 15:37:49,084 INFO L226 Difference]: Without dead ends: 586 [2025-02-05 15:37:49,087 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:37:49,089 INFO L435 NwaCegarLoop]: 951 mSDtfsCounter, 63 mSDsluCounter, 4697 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5648 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:49,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5648 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-02-05 15:37:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2025-02-05 15:37:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 443 states have (on average 1.6275395033860045) internal successors, (721), 461 states have internal predecessors, (721), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 948 transitions. [2025-02-05 15:37:49,121 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 948 transitions. Word has length 69 [2025-02-05 15:37:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,121 INFO L471 AbstractCegarLoop]: Abstraction has 586 states and 948 transitions. [2025-02-05 15:37:49,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 948 transitions. [2025-02-05 15:37:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:37:49,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,123 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] [2025-02-05 15:37:49,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:37:49,123 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1168963232, now seen corresponding path program 1 times [2025-02-05 15:37:49,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87969020] [2025-02-05 15:37:49,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:37:49,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:37:49,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,267 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:37:49,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87969020] [2025-02-05 15:37:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87969020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018573042] [2025-02-05 15:37:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:49,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:49,268 INFO L87 Difference]: Start difference. First operand 586 states and 948 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,350 INFO L93 Difference]: Finished difference Result 1165 states and 1895 transitions. [2025-02-05 15:37:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-02-05 15:37:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,355 INFO L225 Difference]: With dead ends: 1165 [2025-02-05 15:37:49,355 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 15:37:49,357 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:37:49,358 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 49 mSDsluCounter, 4649 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5588 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:49,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5588 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 15:37:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-02-05 15:37:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.620137299771167) internal successors, (708), 455 states have internal predecessors, (708), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 935 transitions. [2025-02-05 15:37:49,375 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 935 transitions. Word has length 70 [2025-02-05 15:37:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 935 transitions. [2025-02-05 15:37:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 935 transitions. [2025-02-05 15:37:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:37:49,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,377 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] [2025-02-05 15:37:49,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:37:49,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,378 INFO L85 PathProgramCache]: Analyzing trace with hash 146169560, now seen corresponding path program 1 times [2025-02-05 15:37:49,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645328610] [2025-02-05 15:37:49,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:37:49,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:37:49,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,508 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:37:49,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645328610] [2025-02-05 15:37:49,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645328610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:49,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201036612] [2025-02-05 15:37:49,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:49,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:49,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:49,509 INFO L87 Difference]: Start difference. First operand 580 states and 935 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:49,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,561 INFO L93 Difference]: Finished difference Result 1153 states and 1869 transitions. [2025-02-05 15:37:49,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:49,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-02-05 15:37:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,568 INFO L225 Difference]: With dead ends: 1153 [2025-02-05 15:37:49,568 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 15:37:49,570 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:37:49,571 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 24 mSDsluCounter, 4613 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5540 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:49,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5540 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 15:37:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-02-05 15:37:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6178489702517163) internal successors, (707), 455 states have internal predecessors, (707), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 934 transitions. [2025-02-05 15:37:49,591 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 934 transitions. Word has length 70 [2025-02-05 15:37:49,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,591 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 934 transitions. [2025-02-05 15:37:49,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 934 transitions. [2025-02-05 15:37:49,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 15:37:49,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,592 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] [2025-02-05 15:37:49,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:37:49,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash 574919533, now seen corresponding path program 1 times [2025-02-05 15:37:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532883394] [2025-02-05 15:37:49,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 15:37:49,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:37:49,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,691 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:37:49,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532883394] [2025-02-05 15:37:49,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532883394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:49,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076871662] [2025-02-05 15:37:49,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:49,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:49,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:49,692 INFO L87 Difference]: Start difference. First operand 580 states and 934 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,727 INFO L93 Difference]: Finished difference Result 1144 states and 1854 transitions. [2025-02-05 15:37:49,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:49,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-02-05 15:37:49,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,731 INFO L225 Difference]: With dead ends: 1144 [2025-02-05 15:37:49,731 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 15:37:49,733 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:37:49,734 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 15 mSDsluCounter, 1823 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:49,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2742 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 15:37:49,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-02-05 15:37:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6155606407322654) internal successors, (706), 455 states have internal predecessors, (706), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 933 transitions. [2025-02-05 15:37:49,748 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 933 transitions. Word has length 71 [2025-02-05 15:37:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,749 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 933 transitions. [2025-02-05 15:37:49,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 933 transitions. [2025-02-05 15:37:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 15:37:49,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,749 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] [2025-02-05 15:37:49,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:37:49,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash -920849976, now seen corresponding path program 1 times [2025-02-05 15:37:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863461902] [2025-02-05 15:37:49,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:37:49,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:37:49,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,815 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:37:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863461902] [2025-02-05 15:37:49,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863461902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:49,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054149758] [2025-02-05 15:37:49,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:49,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:49,816 INFO L87 Difference]: Start difference. First operand 580 states and 933 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,851 INFO L93 Difference]: Finished difference Result 1144 states and 1852 transitions. [2025-02-05 15:37:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:49,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-02-05 15:37:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:49,855 INFO L225 Difference]: With dead ends: 1144 [2025-02-05 15:37:49,855 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 15:37:49,857 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:37:49,858 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 14 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:49,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2744 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 15:37:49,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-02-05 15:37:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6132723112128147) internal successors, (705), 455 states have internal predecessors, (705), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 932 transitions. [2025-02-05 15:37:49,880 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 932 transitions. Word has length 72 [2025-02-05 15:37:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:49,880 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 932 transitions. [2025-02-05 15:37:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 932 transitions. [2025-02-05 15:37:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 15:37:49,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:49,881 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] [2025-02-05 15:37:49,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:37:49,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 404059216, now seen corresponding path program 1 times [2025-02-05 15:37:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819707841] [2025-02-05 15:37:49,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:49,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 15:37:49,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 15:37:49,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:49,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:49,963 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:37:49,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:49,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819707841] [2025-02-05 15:37:49,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819707841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:49,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:49,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:49,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377743692] [2025-02-05 15:37:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:49,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:49,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:49,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:49,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:49,966 INFO L87 Difference]: Start difference. First operand 580 states and 932 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:49,999 INFO L93 Difference]: Finished difference Result 1144 states and 1850 transitions. [2025-02-05 15:37:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:50,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-02-05 15:37:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:50,004 INFO L225 Difference]: With dead ends: 1144 [2025-02-05 15:37:50,004 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 15:37:50,006 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:37:50,006 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 13 mSDsluCounter, 1825 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2746 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:37:50,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2746 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 15:37:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-02-05 15:37:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.6109839816933638) internal successors, (704), 455 states have internal predecessors, (704), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 931 transitions. [2025-02-05 15:37:50,022 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 931 transitions. Word has length 73 [2025-02-05 15:37:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,022 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 931 transitions. [2025-02-05 15:37:50,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:50,023 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 931 transitions. [2025-02-05 15:37:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:37:50,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,024 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] [2025-02-05 15:37:50,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:37:50,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:50,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:50,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1024305077, now seen corresponding path program 1 times [2025-02-05 15:37:50,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:50,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247268826] [2025-02-05 15:37:50,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:50,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:37:50,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:37:50,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,091 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:37:50,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:50,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247268826] [2025-02-05 15:37:50,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247268826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:50,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:50,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:50,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530935561] [2025-02-05 15:37:50,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:50,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:50,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:50,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:50,093 INFO L87 Difference]: Start difference. First operand 580 states and 931 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:50,130 INFO L93 Difference]: Finished difference Result 1144 states and 1848 transitions. [2025-02-05 15:37:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:50,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-02-05 15:37:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:50,135 INFO L225 Difference]: With dead ends: 1144 [2025-02-05 15:37:50,135 INFO L226 Difference]: Without dead ends: 580 [2025-02-05 15:37:50,137 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:37:50,137 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 12 mSDsluCounter, 1826 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:50,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2748 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:50,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-02-05 15:37:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 580. [2025-02-05 15:37:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 437 states have (on average 1.608695652173913) internal successors, (703), 455 states have internal predecessors, (703), 115 states have call successors, (115), 29 states have call predecessors, (115), 27 states have return successors, (112), 109 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 15:37:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 930 transitions. [2025-02-05 15:37:50,155 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 930 transitions. Word has length 74 [2025-02-05 15:37:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,156 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 930 transitions. [2025-02-05 15:37:50,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 930 transitions. [2025-02-05 15:37:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:37:50,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,157 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] [2025-02-05 15:37:50,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:37:50,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:50,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:50,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1904801485, now seen corresponding path program 1 times [2025-02-05 15:37:50,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630873577] [2025-02-05 15:37:50,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:50,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:37:50,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:37:50,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:50,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:50,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630873577] [2025-02-05 15:37:50,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630873577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:50,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580954420] [2025-02-05 15:37:50,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:50,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:50,308 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:37:50,310 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:37:50,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:37:50,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:37:50,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:50,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 1495 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:50,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:50,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:50,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580954420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:50,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:50,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:50,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527088340] [2025-02-05 15:37:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:50,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:50,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:50,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:50,621 INFO L87 Difference]: Start difference. First operand 580 states and 930 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:50,669 INFO L93 Difference]: Finished difference Result 1651 states and 2678 transitions. [2025-02-05 15:37:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:50,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-02-05 15:37:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:50,676 INFO L225 Difference]: With dead ends: 1651 [2025-02-05 15:37:50,676 INFO L226 Difference]: Without dead ends: 1089 [2025-02-05 15:37:50,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:50,679 INFO L435 NwaCegarLoop]: 1578 mSDtfsCounter, 892 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:50,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 2402 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2025-02-05 15:37:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1074. [2025-02-05 15:37:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 816 states have (on average 1.6200980392156863) internal successors, (1322), 851 states have internal predecessors, (1322), 205 states have call successors, (205), 53 states have call predecessors, (205), 52 states have return successors, (207), 197 states have call predecessors, (207), 202 states have call successors, (207) [2025-02-05 15:37:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1734 transitions. [2025-02-05 15:37:50,711 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1734 transitions. Word has length 75 [2025-02-05 15:37:50,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:50,712 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1734 transitions. [2025-02-05 15:37:50,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1734 transitions. [2025-02-05 15:37:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 15:37:50,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:50,713 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] [2025-02-05 15:37:50,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:37:50,914 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,SelfDestructingSolverStorable10 [2025-02-05 15:37:50,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:50,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash -95777477, now seen corresponding path program 1 times [2025-02-05 15:37:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246316243] [2025-02-05 15:37:50,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:50,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:37:50,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:37:50,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:50,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:51,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246316243] [2025-02-05 15:37:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246316243] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386514312] [2025-02-05 15:37:51,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:51,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:51,056 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:37:51,058 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:37:51,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:37:51,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:37:51,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:51,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:51,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 1496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:51,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:51,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:51,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:51,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386514312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:51,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:51,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:51,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145560296] [2025-02-05 15:37:51,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:51,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:51,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:51,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:51,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:51,354 INFO L87 Difference]: Start difference. First operand 1074 states and 1734 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:51,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:51,415 INFO L93 Difference]: Finished difference Result 2639 states and 4288 transitions. [2025-02-05 15:37:51,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:51,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-02-05 15:37:51,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:51,426 INFO L225 Difference]: With dead ends: 2639 [2025-02-05 15:37:51,426 INFO L226 Difference]: Without dead ends: 1583 [2025-02-05 15:37:51,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:51,431 INFO L435 NwaCegarLoop]: 1632 mSDtfsCounter, 893 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:51,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2454 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:51,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-02-05 15:37:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1535. [2025-02-05 15:37:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1168 states have (on average 1.6309931506849316) internal successors, (1905), 1220 states have internal predecessors, (1905), 292 states have call successors, (292), 74 states have call predecessors, (292), 74 states have return successors, (299), 282 states have call predecessors, (299), 289 states have call successors, (299) [2025-02-05 15:37:51,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2496 transitions. [2025-02-05 15:37:51,483 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2496 transitions. Word has length 76 [2025-02-05 15:37:51,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:51,483 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2496 transitions. [2025-02-05 15:37:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2496 transitions. [2025-02-05 15:37:51,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:37:51,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:51,485 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] [2025-02-05 15:37:51,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:37:51,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:51,686 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:51,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1281936583, now seen corresponding path program 1 times [2025-02-05 15:37:51,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:51,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977547059] [2025-02-05 15:37:51,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:51,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:37:51,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:37:51,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:51,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:51,808 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:37:51,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:51,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977547059] [2025-02-05 15:37:51,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977547059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:51,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:51,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:51,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410544761] [2025-02-05 15:37:51,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:51,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:51,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:51,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:51,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:51,810 INFO L87 Difference]: Start difference. First operand 1535 states and 2496 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:37:52,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:52,309 INFO L93 Difference]: Finished difference Result 4529 states and 7519 transitions. [2025-02-05 15:37:52,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:52,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-02-05 15:37:52,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:52,329 INFO L225 Difference]: With dead ends: 4529 [2025-02-05 15:37:52,330 INFO L226 Difference]: Without dead ends: 3012 [2025-02-05 15:37:52,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:52,340 INFO L435 NwaCegarLoop]: 1066 mSDtfsCounter, 920 mSDsluCounter, 3810 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 4876 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:52,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 4876 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3012 states. [2025-02-05 15:37:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3012 to 2965. [2025-02-05 15:37:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2257 states have (on average 1.6304829419583518) internal successors, (3680), 2357 states have internal predecessors, (3680), 563 states have call successors, (563), 142 states have call predecessors, (563), 144 states have return successors, (661), 549 states have call predecessors, (661), 559 states have call successors, (661) [2025-02-05 15:37:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4904 transitions. [2025-02-05 15:37:52,501 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4904 transitions. Word has length 78 [2025-02-05 15:37:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:52,501 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4904 transitions. [2025-02-05 15:37:52,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:37:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4904 transitions. [2025-02-05 15:37:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:37:52,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:52,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] [2025-02-05 15:37:52,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:37:52,503 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:52,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1994506374, now seen corresponding path program 1 times [2025-02-05 15:37:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:52,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548739713] [2025-02-05 15:37:52,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:52,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:52,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:37:52,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:37:52,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:52,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548739713] [2025-02-05 15:37:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548739713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616051938] [2025-02-05 15:37:52,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:52,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:52,646 INFO L229 MonitoredProcess]: Starting monitored process 4 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:37:52,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:37:52,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:37:52,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:37:52,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:52,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:52,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 1514 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:37:52,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:53,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:53,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616051938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:53,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:53,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-02-05 15:37:53,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052835243] [2025-02-05 15:37:53,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:53,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:53,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:53,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:53,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:37:53,049 INFO L87 Difference]: Start difference. First operand 2965 states and 4904 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:37:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:53,786 INFO L93 Difference]: Finished difference Result 8048 states and 13578 transitions. [2025-02-05 15:37:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-02-05 15:37:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:53,821 INFO L225 Difference]: With dead ends: 8048 [2025-02-05 15:37:53,822 INFO L226 Difference]: Without dead ends: 5101 [2025-02-05 15:37:53,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:37:53,842 INFO L435 NwaCegarLoop]: 954 mSDtfsCounter, 789 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 4400 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:53,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 4400 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:37:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2025-02-05 15:37:54,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 5058. [2025-02-05 15:37:54,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5058 states, 3844 states have (on average 1.5837669094693028) internal successors, (6088), 4010 states have internal predecessors, (6088), 950 states have call successors, (950), 256 states have call predecessors, (950), 263 states have return successors, (1253), 931 states have call predecessors, (1253), 944 states have call successors, (1253) [2025-02-05 15:37:54,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 8291 transitions. [2025-02-05 15:37:54,073 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 8291 transitions. Word has length 79 [2025-02-05 15:37:54,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:54,073 INFO L471 AbstractCegarLoop]: Abstraction has 5058 states and 8291 transitions. [2025-02-05 15:37:54,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:37:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 8291 transitions. [2025-02-05 15:37:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:37:54,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:54,075 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] [2025-02-05 15:37:54,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:37:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:54,276 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:54,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1272238644, now seen corresponding path program 1 times [2025-02-05 15:37:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150104084] [2025-02-05 15:37:54,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:54,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:37:54,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:37:54,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:54,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:54,332 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:37:54,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150104084] [2025-02-05 15:37:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150104084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060454889] [2025-02-05 15:37:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:54,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:54,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:54,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:54,334 INFO L87 Difference]: Start difference. First operand 5058 states and 8291 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:37:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:54,573 INFO L93 Difference]: Finished difference Result 10122 states and 16757 transitions. [2025-02-05 15:37:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:54,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-02-05 15:37:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:54,603 INFO L225 Difference]: With dead ends: 10122 [2025-02-05 15:37:54,603 INFO L226 Difference]: Without dead ends: 5082 [2025-02-05 15:37:54,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:54,621 INFO L435 NwaCegarLoop]: 913 mSDtfsCounter, 12 mSDsluCounter, 1799 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:54,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2712 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:54,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5082 states. [2025-02-05 15:37:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5082 to 5066. [2025-02-05 15:37:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5066 states, 3850 states have (on average 1.5823376623376624) internal successors, (6092), 4016 states have internal predecessors, (6092), 950 states have call successors, (950), 260 states have call predecessors, (950), 265 states have return successors, (1242), 929 states have call predecessors, (1242), 944 states have call successors, (1242) [2025-02-05 15:37:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5066 states to 5066 states and 8284 transitions. [2025-02-05 15:37:54,793 INFO L78 Accepts]: Start accepts. Automaton has 5066 states and 8284 transitions. Word has length 79 [2025-02-05 15:37:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:54,793 INFO L471 AbstractCegarLoop]: Abstraction has 5066 states and 8284 transitions. [2025-02-05 15:37:54,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:37:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5066 states and 8284 transitions. [2025-02-05 15:37:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:37:54,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:54,794 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:54,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:37:54,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:54,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash -535342406, now seen corresponding path program 1 times [2025-02-05 15:37:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:54,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649320988] [2025-02-05 15:37:54,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:54,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:54,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:37:54,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:37:54,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:54,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:37:54,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:54,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649320988] [2025-02-05 15:37:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649320988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468895930] [2025-02-05 15:37:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:54,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:54,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:54,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:54,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:54,917 INFO L87 Difference]: Start difference. First operand 5066 states and 8284 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:37:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:55,571 INFO L93 Difference]: Finished difference Result 15131 states and 25733 transitions. [2025-02-05 15:37:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-02-05 15:37:55,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:55,653 INFO L225 Difference]: With dead ends: 15131 [2025-02-05 15:37:55,654 INFO L226 Difference]: Without dead ends: 10083 [2025-02-05 15:37:55,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:55,683 INFO L435 NwaCegarLoop]: 998 mSDtfsCounter, 918 mSDsluCounter, 3619 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 4617 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:55,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 4617 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10083 states. [2025-02-05 15:37:56,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10083 to 10014. [2025-02-05 15:37:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10014 states, 7612 states have (on average 1.5781660535995796) internal successors, (12013), 7938 states have internal predecessors, (12013), 1872 states have call successors, (1872), 514 states have call predecessors, (1872), 529 states have return successors, (2976), 1841 states have call predecessors, (2976), 1862 states have call successors, (2976) [2025-02-05 15:37:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10014 states to 10014 states and 16861 transitions. [2025-02-05 15:37:56,157 INFO L78 Accepts]: Start accepts. Automaton has 10014 states and 16861 transitions. Word has length 87 [2025-02-05 15:37:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:56,158 INFO L471 AbstractCegarLoop]: Abstraction has 10014 states and 16861 transitions. [2025-02-05 15:37:56,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:37:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 10014 states and 16861 transitions. [2025-02-05 15:37:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:37:56,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:56,160 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:56,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:37:56,160 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:56,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash -623128512, now seen corresponding path program 1 times [2025-02-05 15:37:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:56,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058291294] [2025-02-05 15:37:56,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:56,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:37:56,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:37:56,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:56,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:37:56,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:56,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058291294] [2025-02-05 15:37:56,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058291294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:56,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:56,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474137473] [2025-02-05 15:37:56,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:56,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:56,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:56,278 INFO L87 Difference]: Start difference. First operand 10014 states and 16861 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:37:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:56,614 INFO L93 Difference]: Finished difference Result 20082 states and 34295 transitions. [2025-02-05 15:37:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-02-05 15:37:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:56,676 INFO L225 Difference]: With dead ends: 20082 [2025-02-05 15:37:56,676 INFO L226 Difference]: Without dead ends: 10086 [2025-02-05 15:37:56,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:56,721 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 12 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:56,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2703 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10086 states. [2025-02-05 15:37:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10086 to 10054. [2025-02-05 15:37:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10054 states, 7648 states have (on average 1.5759675732217573) internal successors, (12053), 7966 states have internal predecessors, (12053), 1872 states have call successors, (1872), 530 states have call predecessors, (1872), 533 states have return successors, (2960), 1837 states have call predecessors, (2960), 1862 states have call successors, (2960) [2025-02-05 15:37:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10054 states to 10054 states and 16885 transitions. [2025-02-05 15:37:57,089 INFO L78 Accepts]: Start accepts. Automaton has 10054 states and 16885 transitions. Word has length 88 [2025-02-05 15:37:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:57,091 INFO L471 AbstractCegarLoop]: Abstraction has 10054 states and 16885 transitions. [2025-02-05 15:37:57,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:37:57,091 INFO L276 IsEmpty]: Start isEmpty. Operand 10054 states and 16885 transitions. [2025-02-05 15:37:57,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:37:57,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:57,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:37:57,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:37:57,093 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:57,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:57,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1177289767, now seen corresponding path program 1 times [2025-02-05 15:37:57,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838060423] [2025-02-05 15:37:57,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:57,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:57,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:37:57,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:37:57,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:57,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:57,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:57,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:57,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838060423] [2025-02-05 15:37:57,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838060423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:57,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:57,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:57,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912424114] [2025-02-05 15:37:57,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:57,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:57,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:57,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:57,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:57,213 INFO L87 Difference]: Start difference. First operand 10054 states and 16885 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:37:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:58,139 INFO L93 Difference]: Finished difference Result 30173 states and 53637 transitions. [2025-02-05 15:37:58,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:58,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-02-05 15:37:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:58,365 INFO L225 Difference]: With dead ends: 30173 [2025-02-05 15:37:58,366 INFO L226 Difference]: Without dead ends: 20137 [2025-02-05 15:37:58,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:58,424 INFO L435 NwaCegarLoop]: 1024 mSDtfsCounter, 913 mSDsluCounter, 3708 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 4732 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:58,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 4732 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20137 states. [2025-02-05 15:37:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20137 to 20036. [2025-02-05 15:37:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20036 states, 15244 states have (on average 1.572487536079769) internal successors, (23971), 15874 states have internal predecessors, (23971), 3722 states have call successors, (3722), 1054 states have call predecessors, (3722), 1069 states have return successors, (7491), 3667 states have call predecessors, (7491), 3704 states have call successors, (7491) [2025-02-05 15:37:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20036 states to 20036 states and 35184 transitions. [2025-02-05 15:37:59,456 INFO L78 Accepts]: Start accepts. Automaton has 20036 states and 35184 transitions. Word has length 97 [2025-02-05 15:37:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:59,457 INFO L471 AbstractCegarLoop]: Abstraction has 20036 states and 35184 transitions. [2025-02-05 15:37:59,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:37:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20036 states and 35184 transitions. [2025-02-05 15:37:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:37:59,458 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:59,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:37:59,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:37:59,459 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:59,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2101523720, now seen corresponding path program 1 times [2025-02-05 15:37:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664060864] [2025-02-05 15:37:59,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:59,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:37:59,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:37:59,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:59,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:37:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664060864] [2025-02-05 15:37:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664060864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:59,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615560101] [2025-02-05 15:37:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:59,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:59,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:59,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:59,527 INFO L87 Difference]: Start difference. First operand 20036 states and 35184 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:38:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:00,163 INFO L93 Difference]: Finished difference Result 40198 states and 72152 transitions. [2025-02-05 15:38:00,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:00,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-02-05 15:38:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:00,426 INFO L225 Difference]: With dead ends: 40198 [2025-02-05 15:38:00,426 INFO L226 Difference]: Without dead ends: 20180 [2025-02-05 15:38:00,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:00,498 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 11 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:00,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2703 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20180 states. [2025-02-05 15:38:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20180 to 20116. [2025-02-05 15:38:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20116 states, 15316 states have (on average 1.5703186210498825) internal successors, (24051), 15946 states have internal predecessors, (24051), 3722 states have call successors, (3722), 1070 states have call predecessors, (3722), 1077 states have return successors, (7471), 3659 states have call predecessors, (7471), 3704 states have call successors, (7471) [2025-02-05 15:38:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20116 states to 20116 states and 35244 transitions. [2025-02-05 15:38:01,235 INFO L78 Accepts]: Start accepts. Automaton has 20116 states and 35244 transitions. Word has length 98 [2025-02-05 15:38:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:01,236 INFO L471 AbstractCegarLoop]: Abstraction has 20116 states and 35244 transitions. [2025-02-05 15:38:01,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:38:01,236 INFO L276 IsEmpty]: Start isEmpty. Operand 20116 states and 35244 transitions. [2025-02-05 15:38:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:38:01,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:01,238 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-05 15:38:01,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:38:01,239 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:01,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:01,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1691228903, now seen corresponding path program 1 times [2025-02-05 15:38:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667558449] [2025-02-05 15:38:01,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:38:01,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:38:01,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:01,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:38:01,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:01,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667558449] [2025-02-05 15:38:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667558449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:01,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:01,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:01,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802428828] [2025-02-05 15:38:01,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:01,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:01,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:01,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:01,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:01,348 INFO L87 Difference]: Start difference. First operand 20116 states and 35244 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:38:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:03,079 INFO L93 Difference]: Finished difference Result 60485 states and 115379 transitions. [2025-02-05 15:38:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:03,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:38:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:03,541 INFO L225 Difference]: With dead ends: 60485 [2025-02-05 15:38:03,542 INFO L226 Difference]: Without dead ends: 40387 [2025-02-05 15:38:03,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:03,746 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 908 mSDsluCounter, 3750 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 4785 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:03,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 4785 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:38:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40387 states. [2025-02-05 15:38:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40387 to 40222. [2025-02-05 15:38:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40222 states, 30628 states have (on average 1.5678790649079273) internal successors, (48021), 31882 states have internal predecessors, (48021), 7428 states have call successors, (7428), 2134 states have call predecessors, (7428), 2165 states have return successors, (19862), 7325 states have call predecessors, (19862), 7394 states have call successors, (19862) [2025-02-05 15:38:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40222 states to 40222 states and 75311 transitions. [2025-02-05 15:38:05,548 INFO L78 Accepts]: Start accepts. Automaton has 40222 states and 75311 transitions. Word has length 108 [2025-02-05 15:38:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:05,549 INFO L471 AbstractCegarLoop]: Abstraction has 40222 states and 75311 transitions. [2025-02-05 15:38:05,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:38:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 40222 states and 75311 transitions. [2025-02-05 15:38:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:38:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:05,551 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2025-02-05 15:38:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:38:05,551 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:05,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1981473217, now seen corresponding path program 1 times [2025-02-05 15:38:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:05,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005426312] [2025-02-05 15:38:05,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:05,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:38:05,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:38:05,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:05,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:38:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005426312] [2025-02-05 15:38:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005426312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570348792] [2025-02-05 15:38:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:05,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:05,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:05,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:05,621 INFO L87 Difference]: Start difference. First operand 40222 states and 75311 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:38:07,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:07,452 INFO L93 Difference]: Finished difference Result 80746 states and 156349 transitions. [2025-02-05 15:38:07,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:07,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 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:38:07,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:07,873 INFO L225 Difference]: With dead ends: 80746 [2025-02-05 15:38:07,873 INFO L226 Difference]: Without dead ends: 40542 [2025-02-05 15:38:08,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:08,229 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 10 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:08,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2703 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:08,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40542 states. [2025-02-05 15:38:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40542 to 40414. [2025-02-05 15:38:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40414 states, 30804 states have (on average 1.5651538761199844) internal successors, (48213), 32058 states have internal predecessors, (48213), 7428 states have call successors, (7428), 2166 states have call predecessors, (7428), 2181 states have return successors, (19846), 7309 states have call predecessors, (19846), 7394 states have call successors, (19846) [2025-02-05 15:38:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40414 states to 40414 states and 75487 transitions. [2025-02-05 15:38:10,039 INFO L78 Accepts]: Start accepts. Automaton has 40414 states and 75487 transitions. Word has length 109 [2025-02-05 15:38:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:10,039 INFO L471 AbstractCegarLoop]: Abstraction has 40414 states and 75487 transitions. [2025-02-05 15:38:10,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:38:10,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40414 states and 75487 transitions. [2025-02-05 15:38:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 15:38:10,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:10,041 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:10,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:38:10,042 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:10,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2131186645, now seen corresponding path program 1 times [2025-02-05 15:38:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:10,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003344212] [2025-02-05 15:38:10,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:10,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:10,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:38:10,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:38:10,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:10,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-02-05 15:38:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003344212] [2025-02-05 15:38:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003344212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807890876] [2025-02-05 15:38:10,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:10,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:10,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:10,173 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38:10,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:38:10,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 15:38:10,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 15:38:10,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:10,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:10,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1876 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:38:10,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:38:10,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:10,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807890876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:10,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:10,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:38:10,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103091530] [2025-02-05 15:38:10,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:10,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:38:10,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:10,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:38:10,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:38:10,587 INFO L87 Difference]: Start difference. First operand 40414 states and 75487 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:38:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:18,443 INFO L93 Difference]: Finished difference Result 144045 states and 290248 transitions. [2025-02-05 15:38:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:38:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 148 [2025-02-05 15:38:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:19,306 INFO L225 Difference]: With dead ends: 144045 [2025-02-05 15:38:19,306 INFO L226 Difference]: Without dead ends: 103649 [2025-02-05 15:38:19,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:38:19,652 INFO L435 NwaCegarLoop]: 631 mSDtfsCounter, 3237 mSDsluCounter, 1885 mSDsCounter, 0 mSdLazyCounter, 6930 mSolverCounterSat, 739 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3429 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 7669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 739 IncrementalHoareTripleChecker+Valid, 6930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:19,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3429 Valid, 2516 Invalid, 7669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [739 Valid, 6930 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 15:38:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103649 states. [2025-02-05 15:38:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103649 to 102376. [2025-02-05 15:38:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102376 states, 78138 states have (on average 1.5592541401110855) internal successors, (121837), 81176 states have internal predecessors, (121837), 18568 states have call successors, (18568), 5382 states have call predecessors, (18568), 5669 states have return successors, (59559), 18553 states have call predecessors, (59559), 18502 states have call successors, (59559) [2025-02-05 15:38:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 199964 transitions. [2025-02-05 15:38:25,369 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 199964 transitions. Word has length 148 [2025-02-05 15:38:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 102376 states and 199964 transitions. [2025-02-05 15:38:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-02-05 15:38:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 199964 transitions. [2025-02-05 15:38:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-05 15:38:25,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:25,371 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 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] [2025-02-05 15:38:25,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:38:25,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 15:38:25,575 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:25,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1352341078, now seen corresponding path program 1 times [2025-02-05 15:38:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:25,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649220734] [2025-02-05 15:38:25,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:25,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-05 15:38:25,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-05 15:38:25,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:25,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:25,742 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:38:25,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:25,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649220734] [2025-02-05 15:38:25,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649220734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:25,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:25,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:25,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336284038] [2025-02-05 15:38:25,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:25,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:25,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:25,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:25,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:25,744 INFO L87 Difference]: Start difference. First operand 102376 states and 199964 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-02-05 15:38:31,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:31,739 INFO L93 Difference]: Finished difference Result 208165 states and 410283 transitions. [2025-02-05 15:38:31,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:31,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2025-02-05 15:38:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted.