./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product30.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_spec9_product30.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 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:39:00,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:39:00,944 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:39:00,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:39:00,954 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:39:00,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:39:00,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:39:00,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:39:00,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:39:00,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:39:00,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:39:00,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:39:00,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:39:00,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:39:00,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:39:00,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:39:00,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:39:00,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:39:00,984 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 -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2025-02-05 15:39:01,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:39:01,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:39:01,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:39:01,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:39:01,246 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:39:01,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-02-05 15:39:02,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac3466bcf/f76eeb298fc64e21b52cfdb2746abbb0/FLAG7a056bc78 [2025-02-05 15:39:02,841 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:39:02,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2025-02-05 15:39:02,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac3466bcf/f76eeb298fc64e21b52cfdb2746abbb0/FLAG7a056bc78 [2025-02-05 15:39:03,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ac3466bcf/f76eeb298fc64e21b52cfdb2746abbb0 [2025-02-05 15:39:03,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:39:03,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:39:03,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:39:03,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:39:03,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:39:03,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ed9e9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03, skipping insertion in model container [2025-02-05 15:39:03,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,050 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:39:03,183 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_spec9_product30.cil.c[11768,11781] [2025-02-05 15:39:03,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:39:03,382 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:39:03,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2025-02-05 15:39:03,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2025-02-05 15:39:03,403 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_spec9_product30.cil.c[11768,11781] [2025-02-05 15:39:03,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:39:03,478 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:39:03,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03 WrapperNode [2025-02-05 15:39:03,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:39:03,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:39:03,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:39:03,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:39:03,485 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:39:03" (1/1) ... [2025-02-05 15:39:03,511 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:39:03" (1/1) ... [2025-02-05 15:39:03,553 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 869 [2025-02-05 15:39:03,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:39:03,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:39:03,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:39:03,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:39:03,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,613 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 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:39:03,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,614 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:39:03,666 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:39:03,666 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:39:03,666 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:39:03,667 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (1/1) ... [2025-02-05 15:39:03,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:39:03,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:03,697 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:39:03,700 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:39:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:39:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:39:03,718 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:39:03,718 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:39:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:39:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:39:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:39:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:39:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:39:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:39:03,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:39:03,719 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:39:03,720 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:39:03,720 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:39:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:39:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:39:03,721 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:39:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:39:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:39:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:39:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:39:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:39:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:39:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:39:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:39:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:39:03,722 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:39:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:39:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:39:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:39:03,723 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:39:03,723 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:39:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:39:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:39:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:39:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-02-05 15:39:03,724 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:39:03,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:39:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:39:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:39:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:39:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:39:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:39:03,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:39:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:39:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:39:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:39:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:39:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:39:03,894 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:39:03,896 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:39:03,949 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L856: #res := ~retValue_acc~7; [2025-02-05 15:39:03,972 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L778: #res := ~retValue_acc~5; [2025-02-05 15:39:03,976 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L937: #res := ~retValue_acc~8; [2025-02-05 15:39:03,990 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1114: #res := ~retValue_acc~9; [2025-02-05 15:39:04,179 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~18#1; [2025-02-05 15:39:04,179 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1690: #res#1 := ~retValue_acc~17#1; [2025-02-05 15:39:04,254 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1822: #res := ~retValue_acc~21; [2025-02-05 15:39:04,272 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: #res := ~retValue_acc~6; [2025-02-05 15:39:04,302 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1206: #res := ~retValue_acc~13; [2025-02-05 15:39:04,481 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1651: #res := ~retValue_acc~16; [2025-02-05 15:39:04,497 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1157: #res := ~retValue_acc~11; [2025-02-05 15:39:04,645 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299-1: isIdle_#res#1 := isIdle_~retValue_acc~15#1; [2025-02-05 15:39:04,645 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1286-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~14#1; [2025-02-05 15:39:04,689 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2791: #res := ~retValue_acc~24; [2025-02-05 15:39:04,768 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1780-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~19#1; [2025-02-05 15:39:04,768 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1808-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-02-05 15:39:04,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3452-1: main_#res#1 := main_~retValue_acc~27#1; [2025-02-05 15:39:04,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L449-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-02-05 15:39:04,838 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2555: #res := ~retValue_acc~23; [2025-02-05 15:39:04,840 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1123: #res := ~retValue_acc~10; [2025-02-05 15:39:04,844 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3102: #res := ~retValue_acc~25; [2025-02-05 15:39:04,985 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2025-02-05 15:39:04,986 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:39:04,999 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:39:05,000 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:39:05,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:39:05 BoogieIcfgContainer [2025-02-05 15:39:05,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:39:05,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:39:05,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:39:05,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:39:05,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:39:03" (1/3) ... [2025-02-05 15:39:05,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a7bbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:39:05, skipping insertion in model container [2025-02-05 15:39:05,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:39:03" (2/3) ... [2025-02-05 15:39:05,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a7bbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:39:05, skipping insertion in model container [2025-02-05 15:39:05,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:39:05" (3/3) ... [2025-02-05 15:39:05,007 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2025-02-05 15:39:05,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:39:05,033 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product30.cil.c that has 27 procedures, 576 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:39:05,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:39:05,088 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;@10a79292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:39:05,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:39:05,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 576 states, 451 states have (on average 1.6917960088691797) internal successors, (763), 475 states have internal predecessors, (763), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-05 15:39:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-05 15:39:05,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:05,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:05,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:05,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash 88743694, now seen corresponding path program 1 times [2025-02-05 15:39:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:05,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254007357] [2025-02-05 15:39:05,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:05,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:05,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-05 15:39:05,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-05 15:39:05,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:05,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:05,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:05,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254007357] [2025-02-05 15:39:05,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254007357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:05,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:05,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717758112] [2025-02-05 15:39:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:05,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:05,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:05,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:05,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:05,630 INFO L87 Difference]: Start difference. First operand has 576 states, 451 states have (on average 1.6917960088691797) internal successors, (763), 475 states have internal predecessors, (763), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:05,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:05,773 INFO L93 Difference]: Finished difference Result 1132 states and 1884 transitions. [2025-02-05 15:39:05,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2025-02-05 15:39:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:05,786 INFO L225 Difference]: With dead ends: 1132 [2025-02-05 15:39:05,786 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:05,794 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:39:05,796 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 5 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:05,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2801 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:39:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6853932584269662) internal successors, (750), 466 states have internal predecessors, (750), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 937 transitions. [2025-02-05 15:39:05,878 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 937 transitions. Word has length 80 [2025-02-05 15:39:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 937 transitions. [2025-02-05 15:39:05,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 937 transitions. [2025-02-05 15:39:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-02-05 15:39:05,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:05,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:05,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:39:05,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:05,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:05,890 INFO L85 PathProgramCache]: Analyzing trace with hash -477091331, now seen corresponding path program 1 times [2025-02-05 15:39:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139071282] [2025-02-05 15:39:05,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:05,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:05,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-02-05 15:39:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-02-05 15:39:05,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:05,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:06,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:06,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139071282] [2025-02-05 15:39:06,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139071282] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:06,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:06,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:06,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157730410] [2025-02-05 15:39:06,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:06,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:06,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:06,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:06,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:06,095 INFO L87 Difference]: Start difference. First operand 567 states and 937 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:06,151 INFO L93 Difference]: Finished difference Result 1116 states and 1851 transitions. [2025-02-05 15:39:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2025-02-05 15:39:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:06,157 INFO L225 Difference]: With dead ends: 1116 [2025-02-05 15:39:06,157 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:06,159 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:39:06,160 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 4 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:06,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2774 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:06,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:39:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6831460674157304) internal successors, (749), 466 states have internal predecessors, (749), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 936 transitions. [2025-02-05 15:39:06,209 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 936 transitions. Word has length 81 [2025-02-05 15:39:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:06,209 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 936 transitions. [2025-02-05 15:39:06,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 936 transitions. [2025-02-05 15:39:06,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-02-05 15:39:06,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:06,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:06,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:39:06,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:06,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:06,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2015995317, now seen corresponding path program 1 times [2025-02-05 15:39:06,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:06,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498969316] [2025-02-05 15:39:06,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:06,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:06,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-05 15:39:06,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-05 15:39:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:06,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:06,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498969316] [2025-02-05 15:39:06,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498969316] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:06,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967561289] [2025-02-05 15:39:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:06,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:06,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:06,365 INFO L87 Difference]: Start difference. First operand 567 states and 936 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:06,443 INFO L93 Difference]: Finished difference Result 1116 states and 1850 transitions. [2025-02-05 15:39:06,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:06,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2025-02-05 15:39:06,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:06,447 INFO L225 Difference]: With dead ends: 1116 [2025-02-05 15:39:06,448 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:06,450 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:39:06,451 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 3 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2774 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:39:06,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2774 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:39:06,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6808988764044943) internal successors, (748), 466 states have internal predecessors, (748), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 935 transitions. [2025-02-05 15:39:06,476 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 935 transitions. Word has length 82 [2025-02-05 15:39:06,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:06,477 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 935 transitions. [2025-02-05 15:39:06,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 935 transitions. [2025-02-05 15:39:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:39:06,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:06,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:06,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:39:06,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:06,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 639701274, now seen corresponding path program 1 times [2025-02-05 15:39:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195782201] [2025-02-05 15:39:06,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:06,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:39:06,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:39:06,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:06,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:06,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195782201] [2025-02-05 15:39:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195782201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:06,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251298549] [2025-02-05 15:39:06,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:06,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:06,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:06,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:06,633 INFO L87 Difference]: Start difference. First operand 567 states and 935 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:06,678 INFO L93 Difference]: Finished difference Result 1116 states and 1849 transitions. [2025-02-05 15:39:06,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:06,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2025-02-05 15:39:06,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:06,685 INFO L225 Difference]: With dead ends: 1116 [2025-02-05 15:39:06,686 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:06,689 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:39:06,689 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 2 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:06,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2774 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:06,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:06,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:39:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6786516853932585) internal successors, (747), 466 states have internal predecessors, (747), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 934 transitions. [2025-02-05 15:39:06,724 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 934 transitions. Word has length 83 [2025-02-05 15:39:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:06,724 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 934 transitions. [2025-02-05 15:39:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 934 transitions. [2025-02-05 15:39:06,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 15:39:06,728 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:06,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:06,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:39:06,729 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:06,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:06,729 INFO L85 PathProgramCache]: Analyzing trace with hash 184029576, now seen corresponding path program 1 times [2025-02-05 15:39:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216941737] [2025-02-05 15:39:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:06,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 15:39:06,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 15:39:06,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:06,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:06,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216941737] [2025-02-05 15:39:06,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216941737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:06,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:06,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:06,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507285225] [2025-02-05 15:39:06,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:06,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:06,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:06,914 INFO L87 Difference]: Start difference. First operand 567 states and 934 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:06,946 INFO L93 Difference]: Finished difference Result 1116 states and 1848 transitions. [2025-02-05 15:39:06,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:06,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2025-02-05 15:39:06,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:06,951 INFO L225 Difference]: With dead ends: 1116 [2025-02-05 15:39:06,951 INFO L226 Difference]: Without dead ends: 567 [2025-02-05 15:39:06,953 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:39:06,954 INFO L435 NwaCegarLoop]: 926 mSDtfsCounter, 1 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:06,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2774 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:06,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-02-05 15:39:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2025-02-05 15:39:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 445 states have (on average 1.6764044943820224) internal successors, (746), 466 states have internal predecessors, (746), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:06,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 933 transitions. [2025-02-05 15:39:06,974 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 933 transitions. Word has length 84 [2025-02-05 15:39:06,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:06,975 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 933 transitions. [2025-02-05 15:39:06,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:06,975 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 933 transitions. [2025-02-05 15:39:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:39:06,977 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:06,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:06,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:39:06,978 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2060188727, now seen corresponding path program 1 times [2025-02-05 15:39:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:06,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253829558] [2025-02-05 15:39:06,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:06,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 15:39:07,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 15:39:07,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:07,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:07,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253829558] [2025-02-05 15:39:07,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253829558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:07,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:07,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:39:07,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834858703] [2025-02-05 15:39:07,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:07,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:39:07,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:07,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:39:07,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:07,193 INFO L87 Difference]: Start difference. First operand 567 states and 933 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:07,294 INFO L93 Difference]: Finished difference Result 1082 states and 1780 transitions. [2025-02-05 15:39:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:39:07,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-02-05 15:39:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:07,303 INFO L225 Difference]: With dead ends: 1082 [2025-02-05 15:39:07,303 INFO L226 Difference]: Without dead ends: 582 [2025-02-05 15:39:07,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:07,307 INFO L435 NwaCegarLoop]: 921 mSDtfsCounter, 91 mSDsluCounter, 6364 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7285 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:07,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7285 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-02-05 15:39:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2025-02-05 15:39:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 455 states have (on average 1.6725274725274726) internal successors, (761), 478 states have internal predecessors, (761), 97 states have call successors, (97), 26 states have call predecessors, (97), 27 states have return successors, (94), 89 states have call predecessors, (94), 92 states have call successors, (94) [2025-02-05 15:39:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 952 transitions. [2025-02-05 15:39:07,337 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 952 transitions. Word has length 85 [2025-02-05 15:39:07,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:07,337 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 952 transitions. [2025-02-05 15:39:07,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 952 transitions. [2025-02-05 15:39:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:39:07,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:07,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:07,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:39:07,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:07,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:07,343 INFO L85 PathProgramCache]: Analyzing trace with hash 389675158, now seen corresponding path program 1 times [2025-02-05 15:39:07,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:07,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83330517] [2025-02-05 15:39:07,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 15:39:07,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 15:39:07,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:07,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:07,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83330517] [2025-02-05 15:39:07,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83330517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:07,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:39:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136407731] [2025-02-05 15:39:07,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:07,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:07,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:07,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:39:07,437 INFO L87 Difference]: Start difference. First operand 580 states and 952 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:07,477 INFO L93 Difference]: Finished difference Result 1134 states and 1874 transitions. [2025-02-05 15:39:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:39:07,477 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-02-05 15:39:07,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:07,481 INFO L225 Difference]: With dead ends: 1134 [2025-02-05 15:39:07,481 INFO L226 Difference]: Without dead ends: 561 [2025-02-05 15:39:07,483 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:39:07,484 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 0 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:07,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2776 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-02-05 15:39:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2025-02-05 15:39:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6674259681093395) internal successors, (732), 460 states have internal predecessors, (732), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2025-02-05 15:39:07,503 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 85 [2025-02-05 15:39:07,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:07,504 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2025-02-05 15:39:07,505 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:07,505 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2025-02-05 15:39:07,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:39:07,507 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:07,507 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:07,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:39:07,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:07,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:07,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1379449182, now seen corresponding path program 1 times [2025-02-05 15:39:07,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:07,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882360979] [2025-02-05 15:39:07,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:07,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:39:07,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:39:07,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:07,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:07,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882360979] [2025-02-05 15:39:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882360979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519414844] [2025-02-05 15:39:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:07,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:07,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:07,661 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:07,823 INFO L93 Difference]: Finished difference Result 1079 states and 1772 transitions. [2025-02-05 15:39:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-02-05 15:39:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:07,827 INFO L225 Difference]: With dead ends: 1079 [2025-02-05 15:39:07,827 INFO L226 Difference]: Without dead ends: 570 [2025-02-05 15:39:07,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:07,830 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 55 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:07,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4351 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:07,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-05 15:39:07,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-02-05 15:39:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6583143507972664) internal successors, (728), 460 states have internal predecessors, (728), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 915 transitions. [2025-02-05 15:39:07,850 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 915 transitions. Word has length 86 [2025-02-05 15:39:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:07,850 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 915 transitions. [2025-02-05 15:39:07,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:07,850 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 915 transitions. [2025-02-05 15:39:07,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:39:07,852 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:07,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:07,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:39:07,853 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:07,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:07,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1440727598, now seen corresponding path program 1 times [2025-02-05 15:39:07,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909477687] [2025-02-05 15:39:07,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:07,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:07,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:39:07,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:39:07,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:07,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:07,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:07,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909477687] [2025-02-05 15:39:07,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909477687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:07,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:07,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:07,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134296596] [2025-02-05 15:39:07,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:07,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:07,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:07,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:07,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:07,973 INFO L87 Difference]: Start difference. First operand 561 states and 915 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:08,112 INFO L93 Difference]: Finished difference Result 1079 states and 1768 transitions. [2025-02-05 15:39:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-02-05 15:39:08,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:08,117 INFO L225 Difference]: With dead ends: 1079 [2025-02-05 15:39:08,117 INFO L226 Difference]: Without dead ends: 570 [2025-02-05 15:39:08,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:08,120 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 54 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4351 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:08,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4351 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-05 15:39:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-02-05 15:39:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6492027334851935) internal successors, (724), 460 states have internal predecessors, (724), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 911 transitions. [2025-02-05 15:39:08,138 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 911 transitions. Word has length 87 [2025-02-05 15:39:08,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:08,138 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 911 transitions. [2025-02-05 15:39:08,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:08,138 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 911 transitions. [2025-02-05 15:39:08,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:39:08,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:08,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:08,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:39:08,141 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:08,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:08,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1494389921, now seen corresponding path program 1 times [2025-02-05 15:39:08,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:08,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472134997] [2025-02-05 15:39:08,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:08,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:08,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:39:08,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:39:08,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:08,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472134997] [2025-02-05 15:39:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472134997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128466997] [2025-02-05 15:39:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:08,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:08,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:08,254 INFO L87 Difference]: Start difference. First operand 561 states and 911 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:08,410 INFO L93 Difference]: Finished difference Result 1079 states and 1764 transitions. [2025-02-05 15:39:08,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:08,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 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:39:08,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:08,415 INFO L225 Difference]: With dead ends: 1079 [2025-02-05 15:39:08,415 INFO L226 Difference]: Without dead ends: 570 [2025-02-05 15:39:08,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:08,418 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 53 mSDsluCounter, 3458 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:08,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4333 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:08,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-02-05 15:39:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 561. [2025-02-05 15:39:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 439 states have (on average 1.6400911161731206) internal successors, (720), 460 states have internal predecessors, (720), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 907 transitions. [2025-02-05 15:39:08,436 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 907 transitions. Word has length 88 [2025-02-05 15:39:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 907 transitions. [2025-02-05 15:39:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 907 transitions. [2025-02-05 15:39:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:39:08,440 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:08,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:08,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:39:08,440 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:08,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash -963140784, now seen corresponding path program 1 times [2025-02-05 15:39:08,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:08,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592119206] [2025-02-05 15:39:08,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:08,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:08,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:39:08,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:39:08,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:08,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:08,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:08,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592119206] [2025-02-05 15:39:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592119206] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:08,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:39:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172468076] [2025-02-05 15:39:08,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:08,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:39:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:08,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:39:08,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:08,557 INFO L87 Difference]: Start difference. First operand 561 states and 907 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:08,617 INFO L93 Difference]: Finished difference Result 1070 states and 1746 transitions. [2025-02-05 15:39:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:39:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-02-05 15:39:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:08,623 INFO L225 Difference]: With dead ends: 1070 [2025-02-05 15:39:08,623 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 15:39:08,625 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:39:08,626 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 84 mSDsluCounter, 4407 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5303 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:08,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5303 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:08,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 15:39:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-05 15:39:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6411483253588517) internal successors, (686), 439 states have internal predecessors, (686), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:08,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 873 transitions. [2025-02-05 15:39:08,643 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 873 transitions. Word has length 88 [2025-02-05 15:39:08,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:08,644 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 873 transitions. [2025-02-05 15:39:08,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 873 transitions. [2025-02-05 15:39:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 15:39:08,646 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:08,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:08,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:39:08,647 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:08,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1311953361, now seen corresponding path program 1 times [2025-02-05 15:39:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:08,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113587829] [2025-02-05 15:39:08,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:08,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 15:39:08,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 15:39:08,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:08,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:08,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113587829] [2025-02-05 15:39:08,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113587829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:08,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:08,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:08,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700514595] [2025-02-05 15:39:08,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:08,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:08,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:08,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:08,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:08,749 INFO L87 Difference]: Start difference. First operand 540 states and 873 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:08,812 INFO L93 Difference]: Finished difference Result 1049 states and 1712 transitions. [2025-02-05 15:39:08,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-02-05 15:39:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:08,817 INFO L225 Difference]: With dead ends: 1049 [2025-02-05 15:39:08,817 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 15:39:08,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:08,819 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 17 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:08,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4271 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 15:39:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-05 15:39:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.638755980861244) internal successors, (685), 439 states have internal predecessors, (685), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 872 transitions. [2025-02-05 15:39:08,837 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 872 transitions. Word has length 89 [2025-02-05 15:39:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:08,837 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 872 transitions. [2025-02-05 15:39:08,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:08,837 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 872 transitions. [2025-02-05 15:39:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 15:39:08,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:08,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:08,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:39:08,840 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:08,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:08,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1894581276, now seen corresponding path program 1 times [2025-02-05 15:39:08,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:08,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363576703] [2025-02-05 15:39:08,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:08,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:08,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 15:39:08,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 15:39:08,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:08,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:08,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363576703] [2025-02-05 15:39:08,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363576703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:08,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:08,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:08,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835398719] [2025-02-05 15:39:08,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:08,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:08,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:08,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:08,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:08,967 INFO L87 Difference]: Start difference. First operand 540 states and 872 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:09,031 INFO L93 Difference]: Finished difference Result 1049 states and 1711 transitions. [2025-02-05 15:39:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:09,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-02-05 15:39:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:09,036 INFO L225 Difference]: With dead ends: 1049 [2025-02-05 15:39:09,036 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 15:39:09,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:39:09,039 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 16 mSDsluCounter, 3415 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:09,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4271 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 15:39:09,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-05 15:39:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6363636363636365) internal successors, (684), 439 states have internal predecessors, (684), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 871 transitions. [2025-02-05 15:39:09,057 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 871 transitions. Word has length 90 [2025-02-05 15:39:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:09,057 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 871 transitions. [2025-02-05 15:39:09,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:39:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 871 transitions. [2025-02-05 15:39:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 15:39:09,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:09,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:09,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:39:09,060 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -63908492, now seen corresponding path program 1 times [2025-02-05 15:39:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477408981] [2025-02-05 15:39:09,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:09,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:09,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 15:39:09,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 15:39:09,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:09,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477408981] [2025-02-05 15:39:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477408981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:09,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:39:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575376249] [2025-02-05 15:39:09,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:09,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:39:09,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:09,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:39:09,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:09,260 INFO L87 Difference]: Start difference. First operand 540 states and 871 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:09,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:09,347 INFO L93 Difference]: Finished difference Result 1043 states and 1699 transitions. [2025-02-05 15:39:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:39:09,348 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2025-02-05 15:39:09,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:09,353 INFO L225 Difference]: With dead ends: 1043 [2025-02-05 15:39:09,353 INFO L226 Difference]: Without dead ends: 540 [2025-02-05 15:39:09,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:09,356 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 6 mSDsluCounter, 6818 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7673 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:09,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7673 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-02-05 15:39:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2025-02-05 15:39:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 418 states have (on average 1.6339712918660287) internal successors, (683), 439 states have internal predecessors, (683), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 15:39:09,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 870 transitions. [2025-02-05 15:39:09,375 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 870 transitions. Word has length 91 [2025-02-05 15:39:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:09,376 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 870 transitions. [2025-02-05 15:39:09,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:39:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 870 transitions. [2025-02-05 15:39:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 15:39:09,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:09,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:09,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:39:09,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:09,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:09,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1686083415, now seen corresponding path program 1 times [2025-02-05 15:39:09,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:09,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352632469] [2025-02-05 15:39:09,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:09,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:09,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:39:09,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:39:09,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:09,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352632469] [2025-02-05 15:39:09,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352632469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:09,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:09,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:39:09,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490719132] [2025-02-05 15:39:09,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:09,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:39:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:09,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:39:09,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:39:09,598 INFO L87 Difference]: Start difference. First operand 540 states and 870 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:39:11,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:11,397 INFO L93 Difference]: Finished difference Result 1665 states and 2745 transitions. [2025-02-05 15:39:11,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:39:11,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 92 [2025-02-05 15:39:11,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:11,406 INFO L225 Difference]: With dead ends: 1665 [2025-02-05 15:39:11,406 INFO L226 Difference]: Without dead ends: 1170 [2025-02-05 15:39:11,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:39:11,409 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 2601 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 1991 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2665 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 1991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:11,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2665 Valid, 1095 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 1991 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:39:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2025-02-05 15:39:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1038. [2025-02-05 15:39:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 811 states have (on average 1.654747225647349) internal successors, (1342), 841 states have internal predecessors, (1342), 179 states have call successors, (179), 46 states have call predecessors, (179), 47 states have return successors, (181), 163 states have call predecessors, (181), 174 states have call successors, (181) [2025-02-05 15:39:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1702 transitions. [2025-02-05 15:39:11,460 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1702 transitions. Word has length 92 [2025-02-05 15:39:11,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:11,460 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1702 transitions. [2025-02-05 15:39:11,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 6 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 15:39:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1702 transitions. [2025-02-05 15:39:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:39:11,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:11,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:39:11,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:11,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash -657519330, now seen corresponding path program 1 times [2025-02-05 15:39:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189317169] [2025-02-05 15:39:11,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:11,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:39:11,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:39:11,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:11,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:39:11,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:11,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189317169] [2025-02-05 15:39:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189317169] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:11,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306243756] [2025-02-05 15:39:11,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:11,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:11,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:11,770 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:39:11,772 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:39:11,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:39:12,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:39:12,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:12,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:12,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 1742 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:12,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:12,103 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:12,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306243756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:12,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:12,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:39:12,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54106176] [2025-02-05 15:39:12,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:12,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:12,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:12,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:12,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:12,105 INFO L87 Difference]: Start difference. First operand 1038 states and 1702 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:12,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:12,202 INFO L93 Difference]: Finished difference Result 3012 states and 5032 transitions. [2025-02-05 15:39:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:12,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-05 15:39:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:12,222 INFO L225 Difference]: With dead ends: 3012 [2025-02-05 15:39:12,222 INFO L226 Difference]: Without dead ends: 2020 [2025-02-05 15:39:12,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:12,231 INFO L435 NwaCegarLoop]: 1564 mSDtfsCounter, 810 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 2425 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:12,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 2425 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2025-02-05 15:39:12,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1995. [2025-02-05 15:39:12,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1995 states, 1564 states have (on average 1.668158567774936) internal successors, (2609), 1618 states have internal predecessors, (2609), 340 states have call successors, (340), 85 states have call predecessors, (340), 90 states have return successors, (367), 317 states have call predecessors, (367), 335 states have call successors, (367) [2025-02-05 15:39:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 3316 transitions. [2025-02-05 15:39:12,341 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 3316 transitions. Word has length 131 [2025-02-05 15:39:12,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:12,341 INFO L471 AbstractCegarLoop]: Abstraction has 1995 states and 3316 transitions. [2025-02-05 15:39:12,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:12,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 3316 transitions. [2025-02-05 15:39:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:39:12,346 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:12,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:12,355 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:39:12,550 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,SelfDestructingSolverStorable15 [2025-02-05 15:39:12,551 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:12,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1303555383, now seen corresponding path program 1 times [2025-02-05 15:39:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:12,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732587856] [2025-02-05 15:39:12,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:12,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 15:39:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 15:39:12,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:12,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:39:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732587856] [2025-02-05 15:39:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732587856] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:12,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:39:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 15:39:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568059576] [2025-02-05 15:39:12,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:12,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 15:39:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:12,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 15:39:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:39:12,934 INFO L87 Difference]: Start difference. First operand 1995 states and 3316 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:39:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:18,066 INFO L93 Difference]: Finished difference Result 7260 states and 12080 transitions. [2025-02-05 15:39:18,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-05 15:39:18,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2025-02-05 15:39:18,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:18,100 INFO L225 Difference]: With dead ends: 7260 [2025-02-05 15:39:18,101 INFO L226 Difference]: Without dead ends: 5310 [2025-02-05 15:39:18,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-02-05 15:39:18,116 INFO L435 NwaCegarLoop]: 725 mSDtfsCounter, 2249 mSDsluCounter, 3796 mSDsCounter, 0 mSdLazyCounter, 10362 mSolverCounterSat, 648 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2324 SdHoareTripleChecker+Valid, 4521 SdHoareTripleChecker+Invalid, 11010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 648 IncrementalHoareTripleChecker+Valid, 10362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:18,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2324 Valid, 4521 Invalid, 11010 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [648 Valid, 10362 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-02-05 15:39:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2025-02-05 15:39:18,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 5216. [2025-02-05 15:39:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5216 states, 3969 states have (on average 1.6321491559586798) internal successors, (6478), 4112 states have internal predecessors, (6478), 998 states have call successors, (998), 207 states have call predecessors, (998), 248 states have return successors, (1126), 962 states have call predecessors, (1126), 993 states have call successors, (1126) [2025-02-05 15:39:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 8602 transitions. [2025-02-05 15:39:18,354 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 8602 transitions. Word has length 130 [2025-02-05 15:39:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:18,356 INFO L471 AbstractCegarLoop]: Abstraction has 5216 states and 8602 transitions. [2025-02-05 15:39:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:39:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 8602 transitions. [2025-02-05 15:39:18,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 15:39:18,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:18,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:39:18,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1313420127, now seen corresponding path program 1 times [2025-02-05 15:39:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872111750] [2025-02-05 15:39:18,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:18,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:39:18,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:39:18,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:18,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:39:18,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872111750] [2025-02-05 15:39:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872111750] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229124370] [2025-02-05 15:39:18,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:18,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:18,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:18,679 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:39:18,682 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:39:18,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 15:39:19,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 15:39:19,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:19,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:19,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1741 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:19,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:19,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229124370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:39:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177808637] [2025-02-05 15:39:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:19,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:19,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:19,218 INFO L87 Difference]: Start difference. First operand 5216 states and 8602 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:19,639 INFO L93 Difference]: Finished difference Result 13350 states and 22225 transitions. [2025-02-05 15:39:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-02-05 15:39:19,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:19,740 INFO L225 Difference]: With dead ends: 13350 [2025-02-05 15:39:19,740 INFO L226 Difference]: Without dead ends: 8179 [2025-02-05 15:39:19,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:19,791 INFO L435 NwaCegarLoop]: 988 mSDtfsCounter, 838 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:19,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1796 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8179 states. [2025-02-05 15:39:20,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8179 to 8177. [2025-02-05 15:39:20,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8177 states, 6189 states have (on average 1.6257876878332524) internal successors, (10062), 6422 states have internal predecessors, (10062), 1600 states have call successors, (1600), 318 states have call predecessors, (1600), 387 states have return successors, (1899), 1568 states have call predecessors, (1899), 1595 states have call successors, (1899) [2025-02-05 15:39:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8177 states to 8177 states and 13561 transitions. [2025-02-05 15:39:20,191 INFO L78 Accepts]: Start accepts. Automaton has 8177 states and 13561 transitions. Word has length 131 [2025-02-05 15:39:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 8177 states and 13561 transitions. [2025-02-05 15:39:20,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:20,192 INFO L276 IsEmpty]: Start isEmpty. Operand 8177 states and 13561 transitions. [2025-02-05 15:39:20,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:39:20,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:20,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:20,206 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:39:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 15:39:20,401 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:20,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2061136624, now seen corresponding path program 1 times [2025-02-05 15:39:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:20,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272528034] [2025-02-05 15:39:20,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:20,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:39:20,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:39:20,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:20,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:39:20,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:20,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272528034] [2025-02-05 15:39:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272528034] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:20,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740499609] [2025-02-05 15:39:20,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:20,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:20,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:20,696 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:39:20,704 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:39:20,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:39:20,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:39:20,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:20,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:20,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1743 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:20,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:21,014 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740499609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:39:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612516037] [2025-02-05 15:39:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:21,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:21,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:21,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:21,017 INFO L87 Difference]: Start difference. First operand 8177 states and 13561 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:21,393 INFO L93 Difference]: Finished difference Result 22235 states and 37373 transitions. [2025-02-05 15:39:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:21,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-02-05 15:39:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:21,460 INFO L225 Difference]: With dead ends: 22235 [2025-02-05 15:39:21,460 INFO L226 Difference]: Without dead ends: 14103 [2025-02-05 15:39:21,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:21,494 INFO L435 NwaCegarLoop]: 944 mSDtfsCounter, 837 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:21,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1757 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14103 states. [2025-02-05 15:39:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14103 to 14100. [2025-02-05 15:39:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14100 states, 10630 states have (on average 1.620507996237065) internal successors, (17226), 11043 states have internal predecessors, (17226), 2804 states have call successors, (2804), 540 states have call predecessors, (2804), 665 states have return successors, (3605), 2780 states have call predecessors, (3605), 2799 states have call successors, (3605) [2025-02-05 15:39:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14100 states to 14100 states and 23635 transitions. [2025-02-05 15:39:22,180 INFO L78 Accepts]: Start accepts. Automaton has 14100 states and 23635 transitions. Word has length 132 [2025-02-05 15:39:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:22,181 INFO L471 AbstractCegarLoop]: Abstraction has 14100 states and 23635 transitions. [2025-02-05 15:39:22,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 14100 states and 23635 transitions. [2025-02-05 15:39:22,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:39:22,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:22,186 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:22,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:22,387 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:22,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash -529459527, now seen corresponding path program 1 times [2025-02-05 15:39:22,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:22,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617565476] [2025-02-05 15:39:22,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:22,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:22,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:39:22,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:39:22,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:22,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:22,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:39:22,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617565476] [2025-02-05 15:39:22,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617565476] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:22,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862401978] [2025-02-05 15:39:22,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:22,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:22,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:22,674 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:39:22,675 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:39:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:39:22,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:39:22,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:22,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:22,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1745 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:22,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:23,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862401978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:23,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:39:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860033808] [2025-02-05 15:39:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:23,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:23,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:23,006 INFO L87 Difference]: Start difference. First operand 14100 states and 23635 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:23,644 INFO L93 Difference]: Finished difference Result 40006 states and 68406 transitions. [2025-02-05 15:39:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-02-05 15:39:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:23,786 INFO L225 Difference]: With dead ends: 40006 [2025-02-05 15:39:23,786 INFO L226 Difference]: Without dead ends: 25951 [2025-02-05 15:39:23,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:23,930 INFO L435 NwaCegarLoop]: 933 mSDtfsCounter, 836 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:23,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 1749 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25951 states. [2025-02-05 15:39:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25951 to 25947. [2025-02-05 15:39:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25947 states, 19513 states have (on average 1.6159483421308871) internal successors, (31532), 20286 states have internal predecessors, (31532), 5212 states have call successors, (5212), 984 states have call predecessors, (5212), 1221 states have return successors, (7509), 5204 states have call predecessors, (7509), 5207 states have call successors, (7509) [2025-02-05 15:39:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25947 states to 25947 states and 44253 transitions. [2025-02-05 15:39:24,895 INFO L78 Accepts]: Start accepts. Automaton has 25947 states and 44253 transitions. Word has length 133 [2025-02-05 15:39:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:24,896 INFO L471 AbstractCegarLoop]: Abstraction has 25947 states and 44253 transitions. [2025-02-05 15:39:24,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:24,897 INFO L276 IsEmpty]: Start isEmpty. Operand 25947 states and 44253 transitions. [2025-02-05 15:39:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 15:39:24,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:24,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:24,910 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:39:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:25,106 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:25,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 766434634, now seen corresponding path program 1 times [2025-02-05 15:39:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474501780] [2025-02-05 15:39:25,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:25,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:39:25,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:39:25,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:25,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:39:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474501780] [2025-02-05 15:39:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474501780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47550171] [2025-02-05 15:39:25,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:25,300 INFO L229 MonitoredProcess]: Starting monitored process 6 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:39:25,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:39:25,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 15:39:25,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 15:39:25,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:25,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:25,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 1747 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:25,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:25,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:25,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47550171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:25,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:25,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:39:25,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010899943] [2025-02-05 15:39:25,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:25,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:25,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:25,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:25,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:25,586 INFO L87 Difference]: Start difference. First operand 25947 states and 44253 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:27,352 INFO L93 Difference]: Finished difference Result 75549 states and 132863 transitions. [2025-02-05 15:39:27,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:27,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-02-05 15:39:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:27,768 INFO L225 Difference]: With dead ends: 75549 [2025-02-05 15:39:27,768 INFO L226 Difference]: Without dead ends: 49647 [2025-02-05 15:39:27,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:27,942 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 835 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1740 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:27,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 1740 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49647 states. [2025-02-05 15:39:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49647 to 49642. [2025-02-05 15:39:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49642 states, 37280 states have (on average 1.6117489270386267) internal successors, (60086), 38773 states have internal predecessors, (60086), 10028 states have call successors, (10028), 1872 states have call predecessors, (10028), 2333 states have return successors, (16913), 10052 states have call predecessors, (16913), 10023 states have call successors, (16913) [2025-02-05 15:39:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49642 states to 49642 states and 87027 transitions. [2025-02-05 15:39:30,749 INFO L78 Accepts]: Start accepts. Automaton has 49642 states and 87027 transitions. Word has length 134 [2025-02-05 15:39:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:30,750 INFO L471 AbstractCegarLoop]: Abstraction has 49642 states and 87027 transitions. [2025-02-05 15:39:30,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 49642 states and 87027 transitions. [2025-02-05 15:39:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-05 15:39:30,757 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:30,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:39:30,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:39:30,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:30,958 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:30,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2010523117, now seen corresponding path program 1 times [2025-02-05 15:39:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:30,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371016117] [2025-02-05 15:39:30,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:30,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:30,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:39:30,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:39:30,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:30,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:39:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371016117] [2025-02-05 15:39:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371016117] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245346792] [2025-02-05 15:39:31,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:31,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:31,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:31,407 INFO L229 MonitoredProcess]: Starting monitored process 7 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:39:31,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:39:31,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-02-05 15:39:31,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-02-05 15:39:31,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:31,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:31,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 1749 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:31,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:39:31,685 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:31,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245346792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:31,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:31,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-02-05 15:39:31,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294651250] [2025-02-05 15:39:31,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:31,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:39:31,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:31,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:39:31,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:31,687 INFO L87 Difference]: Start difference. First operand 49642 states and 87027 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:35,404 INFO L93 Difference]: Finished difference Result 146636 states and 269939 transitions. [2025-02-05 15:39:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:39:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-02-05 15:39:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:36,257 INFO L225 Difference]: With dead ends: 146636 [2025-02-05 15:39:36,258 INFO L226 Difference]: Without dead ends: 97031 [2025-02-05 15:39:36,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:39:36,563 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 834 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:36,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1737 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:39:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97031 states. [2025-02-05 15:39:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97031 to 97025. [2025-02-05 15:39:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97025 states, 72808 states have (on average 1.6075293923744642) internal successors, (117041), 75741 states have internal predecessors, (117041), 19660 states have call successors, (19660), 3648 states have call predecessors, (19660), 4556 states have return successors, (41132), 19747 states have call predecessors, (41132), 19655 states have call successors, (41132) [2025-02-05 15:39:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97025 states to 97025 states and 177833 transitions. [2025-02-05 15:39:41,817 INFO L78 Accepts]: Start accepts. Automaton has 97025 states and 177833 transitions. Word has length 135 [2025-02-05 15:39:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:39:41,818 INFO L471 AbstractCegarLoop]: Abstraction has 97025 states and 177833 transitions. [2025-02-05 15:39:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:39:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 97025 states and 177833 transitions. [2025-02-05 15:39:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 15:39:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:39:41,854 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:41,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:39:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 15:39:42,059 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:39:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:39:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1394758853, now seen corresponding path program 1 times [2025-02-05 15:39:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:39:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990455911] [2025-02-05 15:39:42,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:39:42,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 15:39:42,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 15:39:42,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 15:39:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:39:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990455911] [2025-02-05 15:39:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990455911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:39:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260318497] [2025-02-05 15:39:42,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:39:42,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:39:42,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:39:42,640 INFO L229 MonitoredProcess]: Starting monitored process 8 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:39:42,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:39:42,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 15:39:42,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 15:39:42,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:39:42,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:39:42,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 2199 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:39:43,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:39:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-02-05 15:39:43,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:39:43,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260318497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:39:43,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:39:43,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-02-05 15:39:43,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599038049] [2025-02-05 15:39:43,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:39:43,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:39:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:39:43,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:39:43,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:39:43,039 INFO L87 Difference]: Start difference. First operand 97025 states and 177833 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-05 15:39:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:47,813 INFO L93 Difference]: Finished difference Result 196973 states and 377232 transitions. [2025-02-05 15:39:47,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:47,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 212 [2025-02-05 15:39:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:48,590 INFO L225 Difference]: With dead ends: 196973 [2025-02-05 15:39:48,590 INFO L226 Difference]: Without dead ends: 99995 [2025-02-05 15:39:49,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:39:49,232 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 144 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 2404 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:49,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 2404 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99995 states.