./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_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_spec3_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 4fa4154afcc1fa94c570756c4d3485a9415aeef22801b46450f13cd61ecf8230 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:38:08,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:38:08,832 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:38:08,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:38:08,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:38:08,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:38:08,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:38:08,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:38:08,867 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:38:08,868 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:38:08,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:38:08,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:38:08,868 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:38:08,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:38:08,869 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:38:08,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:38:08,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:38:08,870 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:38:08,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:38:08,870 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:38:08,870 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:38:08,871 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:38:08,871 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:08,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:38:08,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:38:08,872 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 -> 4fa4154afcc1fa94c570756c4d3485a9415aeef22801b46450f13cd61ecf8230 [2025-02-05 15:38:09,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:38:09,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:38:09,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:38:09,177 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:38:09,178 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:38:09,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product30.cil.c [2025-02-05 15:38:10,556 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8008baa37/63e84c3d3abb49d792b7337bc51d1c23/FLAG1a480bc25 [2025-02-05 15:38:10,960 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:38:10,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product30.cil.c [2025-02-05 15:38:10,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8008baa37/63e84c3d3abb49d792b7337bc51d1c23/FLAG1a480bc25 [2025-02-05 15:38:11,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8008baa37/63e84c3d3abb49d792b7337bc51d1c23 [2025-02-05 15:38:11,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:38:11,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:38:11,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:11,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:38:11,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:38:11,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5c9212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11, skipping insertion in model container [2025-02-05 15:38:11,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:38:11,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product30.cil.c[14523,14536] [2025-02-05 15:38:11,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:11,606 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:38:11,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2025-02-05 15:38:11,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2025-02-05 15:38:11,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2025-02-05 15:38:11,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [623] [2025-02-05 15:38:11,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [813] [2025-02-05 15:38:11,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [828] [2025-02-05 15:38:11,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [837] [2025-02-05 15:38:11,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2419] [2025-02-05 15:38:11,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2785] [2025-02-05 15:38:11,616 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2820] [2025-02-05 15:38:11,658 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product30.cil.c[14523,14536] [2025-02-05 15:38:11,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:38:11,775 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:38:11,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11 WrapperNode [2025-02-05 15:38:11,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:38:11,777 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:11,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:38:11,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:38:11,783 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:38:11" (1/1) ... [2025-02-05 15:38:11,804 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:38:11" (1/1) ... [2025-02-05 15:38:11,850 INFO L138 Inliner]: procedures = 93, calls = 353, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 945 [2025-02-05 15:38:11,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:38:11,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:38:11,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:38:11,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:38:11,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,910 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:38:11,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,934 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,938 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,966 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:38:11,967 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:38:11,967 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:38:11,967 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:38:11,968 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (1/1) ... [2025-02-05 15:38:11,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:38:11,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:12,009 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:38:12,014 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:38:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:38:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:38:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:38:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:38:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:38:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:38:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:38:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:38:12,037 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:38:12,037 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:38:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:38:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:38:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:38:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:38:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-02-05 15:38:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:38:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:38:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:38:12,038 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:38:12,038 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:38:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:38:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:38:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:38:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:38:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:38:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:38:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:38:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-02-05 15:38:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-02-05 15:38:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:38:12,039 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:38:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:38:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:38:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:38:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:38:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:38:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:38:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:38:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:38:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:38:12,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:38:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:38:12,041 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:38:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:38:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:38:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:38:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:38:12,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:38:12,043 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:38:12,043 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:38:12,043 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:38:12,043 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:38:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:38:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-02-05 15:38:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-02-05 15:38:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:38:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:38:12,044 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:38:12,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:38:12,264 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:38:12,266 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:38:12,305 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1140: #res := ~retValue_acc~9; [2025-02-05 15:38:12,339 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: #res := ~retValue_acc~0; [2025-02-05 15:38:12,454 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: #res#1 := ~retValue_acc~14#1; [2025-02-05 15:38:12,455 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1698-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~15#1; [2025-02-05 15:38:12,473 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1796: #res := ~retValue_acc~18; [2025-02-05 15:38:12,765 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1625: #res := ~retValue_acc~13; [2025-02-05 15:38:12,854 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-02-05 15:38:12,855 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1273-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-02-05 15:38:12,971 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1097-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~7#1; [2025-02-05 15:38:12,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3478: #res := ~retValue_acc~27; [2025-02-05 15:38:12,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~2; [2025-02-05 15:38:12,996 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L915: #res := ~retValue_acc~5; [2025-02-05 15:38:12,998 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1088: #res := ~retValue_acc~6; [2025-02-05 15:38:13,206 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: #res := ~retValue_acc~1; [2025-02-05 15:38:13,227 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1131: #res := ~retValue_acc~8; [2025-02-05 15:38:13,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1180-1: isEmpty_#res#1 := isEmpty_~retValue_acc~10#1; [2025-02-05 15:38:13,346 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3167: #res := ~retValue_acc~26; [2025-02-05 15:38:13,459 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1754-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~16#1; [2025-02-05 15:38:13,460 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~17#1; [2025-02-05 15:38:13,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L525-1: main_#res#1 := main_~retValue_acc~4#1; [2025-02-05 15:38:13,554 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2817-1: valid_product_#res#1 := valid_product_~retValue_acc~24#1; [2025-02-05 15:38:13,566 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2931: #res := ~retValue_acc~25; [2025-02-05 15:38:13,732 INFO L? ?]: Removed 474 outVars from TransFormulas that were not future-live. [2025-02-05 15:38:13,732 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:38:13,768 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:38:13,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:38:13,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:13 BoogieIcfgContainer [2025-02-05 15:38:13,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:38:13,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:38:13,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:38:13,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:38:13,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:38:11" (1/3) ... [2025-02-05 15:38:13,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3680be07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:13, skipping insertion in model container [2025-02-05 15:38:13,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:38:11" (2/3) ... [2025-02-05 15:38:13,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3680be07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:38:13, skipping insertion in model container [2025-02-05 15:38:13,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:38:13" (3/3) ... [2025-02-05 15:38:13,783 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product30.cil.c [2025-02-05 15:38:13,799 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:38:13,803 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product30.cil.c that has 28 procedures, 605 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:38:13,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:38:13,902 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;@16d1e4b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:38:13,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:38:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 605 states, 467 states have (on average 1.6745182012847966) internal successors, (782), 488 states have internal predecessors, (782), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-02-05 15:38:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:38:13,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:13,929 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:13,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:13,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:13,935 INFO L85 PathProgramCache]: Analyzing trace with hash -458338266, now seen corresponding path program 1 times [2025-02-05 15:38:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23959004] [2025-02-05 15:38:13,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:14,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:38:14,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:38:14,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:14,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23959004] [2025-02-05 15:38:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23959004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:14,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:14,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854861637] [2025-02-05 15:38:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:14,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:14,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:14,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:14,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:14,806 INFO L87 Difference]: Start difference. First operand has 605 states, 467 states have (on average 1.6745182012847966) internal successors, (782), 488 states have internal predecessors, (782), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:15,055 INFO L93 Difference]: Finished difference Result 1207 states and 2008 transitions. [2025-02-05 15:38:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-02-05 15:38:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:15,083 INFO L225 Difference]: With dead ends: 1207 [2025-02-05 15:38:15,084 INFO L226 Difference]: Without dead ends: 609 [2025-02-05 15:38:15,092 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:38:15,098 INFO L435 NwaCegarLoop]: 983 mSDtfsCounter, 91 mSDsluCounter, 4829 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5812 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:15,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5812 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:15,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-05 15:38:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 607. [2025-02-05 15:38:15,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 470 states have (on average 1.6680851063829787) internal successors, (784), 490 states have internal predecessors, (784), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 103 states have call predecessors, (108), 106 states have call successors, (108) [2025-02-05 15:38:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 1001 transitions. [2025-02-05 15:38:15,220 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 1001 transitions. Word has length 67 [2025-02-05 15:38:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:15,220 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 1001 transitions. [2025-02-05 15:38:15,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 1001 transitions. [2025-02-05 15:38:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:38:15,227 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:15,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:15,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:38:15,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:15,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 505168755, now seen corresponding path program 1 times [2025-02-05 15:38:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967044119] [2025-02-05 15:38:15,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:15,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:38:15,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:38:15,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:15,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:15,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:15,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967044119] [2025-02-05 15:38:15,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967044119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489872983] [2025-02-05 15:38:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:15,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:15,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:15,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:15,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:15,482 INFO L87 Difference]: Start difference. First operand 607 states and 1001 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:15,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:15,575 INFO L93 Difference]: Finished difference Result 1196 states and 1983 transitions. [2025-02-05 15:38:15,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:15,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-02-05 15:38:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:15,582 INFO L225 Difference]: With dead ends: 1196 [2025-02-05 15:38:15,583 INFO L226 Difference]: Without dead ends: 583 [2025-02-05 15:38:15,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:15,589 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 14 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:15,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2908 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-02-05 15:38:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2025-02-05 15:38:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 449 states have (on average 1.6592427616926504) internal successors, (745), 467 states have internal predecessors, (745), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 958 transitions. [2025-02-05 15:38:15,640 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 958 transitions. Word has length 68 [2025-02-05 15:38:15,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:15,641 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 958 transitions. [2025-02-05 15:38:15,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 958 transitions. [2025-02-05 15:38:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:38:15,645 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:15,647 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:15,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:38:15,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:15,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash 828144982, now seen corresponding path program 1 times [2025-02-05 15:38:15,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:15,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783183572] [2025-02-05 15:38:15,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:15,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:38:15,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:38:15,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:15,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:16,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783183572] [2025-02-05 15:38:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783183572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:16,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:16,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:16,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364955183] [2025-02-05 15:38:16,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:16,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:16,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:16,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:16,017 INFO L87 Difference]: Start difference. First operand 583 states and 958 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:16,147 INFO L93 Difference]: Finished difference Result 1159 states and 1915 transitions. [2025-02-05 15:38:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:16,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-02-05 15:38:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:16,156 INFO L225 Difference]: With dead ends: 1159 [2025-02-05 15:38:16,156 INFO L226 Difference]: Without dead ends: 577 [2025-02-05 15:38:16,160 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:38:16,162 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 77 mSDsluCounter, 4665 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5612 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:16,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5612 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-02-05 15:38:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2025-02-05 15:38:16,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 443 states have (on average 1.652370203160271) internal successors, (732), 461 states have internal predecessors, (732), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 945 transitions. [2025-02-05 15:38:16,196 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 945 transitions. Word has length 68 [2025-02-05 15:38:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:16,198 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 945 transitions. [2025-02-05 15:38:16,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 945 transitions. [2025-02-05 15:38:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 15:38:16,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:16,199 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:16,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:38:16,200 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:16,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1435692416, now seen corresponding path program 1 times [2025-02-05 15:38:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093628418] [2025-02-05 15:38:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:16,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 15:38:16,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 15:38:16,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:16,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:16,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:16,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:16,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093628418] [2025-02-05 15:38:16,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093628418] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:16,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:16,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419170379] [2025-02-05 15:38:16,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:16,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:16,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:16,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:16,411 INFO L87 Difference]: Start difference. First operand 577 states and 945 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:16,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:16,487 INFO L93 Difference]: Finished difference Result 1147 states and 1889 transitions. [2025-02-05 15:38:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:16,488 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-02-05 15:38:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:16,494 INFO L225 Difference]: With dead ends: 1147 [2025-02-05 15:38:16,495 INFO L226 Difference]: Without dead ends: 571 [2025-02-05 15:38:16,498 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:38:16,499 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 63 mSDsluCounter, 4617 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5552 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:16,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5552 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:16,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-02-05 15:38:16,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-02-05 15:38:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 437 states have (on average 1.6453089244851258) internal successors, (719), 455 states have internal predecessors, (719), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:16,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 932 transitions. [2025-02-05 15:38:16,531 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 932 transitions. Word has length 69 [2025-02-05 15:38:16,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:16,532 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 932 transitions. [2025-02-05 15:38:16,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:16,532 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 932 transitions. [2025-02-05 15:38:16,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:38:16,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:16,534 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:16,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:38:16,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2090320144, now seen corresponding path program 1 times [2025-02-05 15:38:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810170567] [2025-02-05 15:38:16,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:16,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:16,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:38:16,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:38:16,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:16,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:16,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:16,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810170567] [2025-02-05 15:38:16,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810170567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:16,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:16,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:16,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009551334] [2025-02-05 15:38:16,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:16,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:16,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:16,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:16,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:16,785 INFO L87 Difference]: Start difference. First operand 571 states and 932 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:16,872 INFO L93 Difference]: Finished difference Result 1135 states and 1863 transitions. [2025-02-05 15:38:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-02-05 15:38:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:16,879 INFO L225 Difference]: With dead ends: 1135 [2025-02-05 15:38:16,879 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 15:38:16,882 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:38:16,883 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 49 mSDsluCounter, 4569 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5492 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:16,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5492 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 15:38:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-02-05 15:38:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 431 states have (on average 1.6380510440835268) internal successors, (706), 449 states have internal predecessors, (706), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:16,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 919 transitions. [2025-02-05 15:38:16,908 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 919 transitions. Word has length 70 [2025-02-05 15:38:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:16,909 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 919 transitions. [2025-02-05 15:38:16,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 919 transitions. [2025-02-05 15:38:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:38:16,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:16,910 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:16,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:38:16,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:16,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1181853480, now seen corresponding path program 1 times [2025-02-05 15:38:16,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:16,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600859931] [2025-02-05 15:38:16,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:16,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:38:16,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:38:16,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:16,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:17,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:17,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600859931] [2025-02-05 15:38:17,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600859931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:17,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:17,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:38:17,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749679320] [2025-02-05 15:38:17,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:17,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:38:17,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:17,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:38:17,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:38:17,115 INFO L87 Difference]: Start difference. First operand 565 states and 919 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:17,198 INFO L93 Difference]: Finished difference Result 1123 states and 1837 transitions. [2025-02-05 15:38:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:38:17,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-02-05 15:38:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:17,205 INFO L225 Difference]: With dead ends: 1123 [2025-02-05 15:38:17,205 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 15:38:17,209 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:38:17,211 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 24 mSDsluCounter, 4533 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5444 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:17,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5444 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 15:38:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-02-05 15:38:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 431 states have (on average 1.6357308584686774) internal successors, (705), 449 states have internal predecessors, (705), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 918 transitions. [2025-02-05 15:38:17,243 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 918 transitions. Word has length 70 [2025-02-05 15:38:17,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:17,244 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 918 transitions. [2025-02-05 15:38:17,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 918 transitions. [2025-02-05 15:38:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 15:38:17,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:17,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:17,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:38:17,249 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:17,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash -104088358, now seen corresponding path program 1 times [2025-02-05 15:38:17,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:17,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580824121] [2025-02-05 15:38:17,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:17,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 15:38:17,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:38:17,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:17,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:17,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580824121] [2025-02-05 15:38:17,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580824121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:17,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:17,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:17,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84499010] [2025-02-05 15:38:17,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:17,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:17,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:17,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:17,372 INFO L87 Difference]: Start difference. First operand 565 states and 918 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:17,444 INFO L93 Difference]: Finished difference Result 1114 states and 1822 transitions. [2025-02-05 15:38:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-02-05 15:38:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:17,450 INFO L225 Difference]: With dead ends: 1114 [2025-02-05 15:38:17,450 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 15:38:17,454 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:38:17,454 INFO L435 NwaCegarLoop]: 903 mSDtfsCounter, 15 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2694 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:17,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2694 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:17,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 15:38:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-02-05 15:38:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 431 states have (on average 1.6334106728538282) internal successors, (704), 449 states have internal predecessors, (704), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 917 transitions. [2025-02-05 15:38:17,480 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 917 transitions. Word has length 71 [2025-02-05 15:38:17,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:17,481 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 917 transitions. [2025-02-05 15:38:17,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:17,481 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 917 transitions. [2025-02-05 15:38:17,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 15:38:17,482 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:17,483 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:17,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:38:17,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:17,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:17,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1079270840, now seen corresponding path program 1 times [2025-02-05 15:38:17,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434442229] [2025-02-05 15:38:17,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:17,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:38:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:38:17,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:17,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:17,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434442229] [2025-02-05 15:38:17,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434442229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:17,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:17,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:17,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810924405] [2025-02-05 15:38:17,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:17,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:17,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:17,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:17,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:17,592 INFO L87 Difference]: Start difference. First operand 565 states and 917 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:17,650 INFO L93 Difference]: Finished difference Result 1114 states and 1820 transitions. [2025-02-05 15:38:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:17,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-02-05 15:38:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:17,656 INFO L225 Difference]: With dead ends: 1114 [2025-02-05 15:38:17,657 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 15:38:17,660 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:38:17,661 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 14 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:17,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2696 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 15:38:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-02-05 15:38:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 431 states have (on average 1.631090487238979) internal successors, (703), 449 states have internal predecessors, (703), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 916 transitions. [2025-02-05 15:38:17,688 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 916 transitions. Word has length 72 [2025-02-05 15:38:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:17,688 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 916 transitions. [2025-02-05 15:38:17,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 916 transitions. [2025-02-05 15:38:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-05 15:38:17,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:17,691 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:17,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:38:17,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:17,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:17,692 INFO L85 PathProgramCache]: Analyzing trace with hash -442175971, now seen corresponding path program 1 times [2025-02-05 15:38:17,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:17,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487610635] [2025-02-05 15:38:17,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:17,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-05 15:38:17,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-05 15:38:17,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:17,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:17,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:17,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487610635] [2025-02-05 15:38:17,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487610635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:17,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:17,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:17,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030987655] [2025-02-05 15:38:17,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:17,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:17,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:17,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:17,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:17,799 INFO L87 Difference]: Start difference. First operand 565 states and 916 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:17,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:17,845 INFO L93 Difference]: Finished difference Result 1114 states and 1818 transitions. [2025-02-05 15:38:17,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:17,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-02-05 15:38:17,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:17,852 INFO L225 Difference]: With dead ends: 1114 [2025-02-05 15:38:17,852 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 15:38:17,855 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:38:17,856 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 13 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2698 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:38:17,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2698 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 15:38:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-02-05 15:38:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 431 states have (on average 1.62877030162413) internal successors, (702), 449 states have internal predecessors, (702), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 915 transitions. [2025-02-05 15:38:17,880 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 915 transitions. Word has length 73 [2025-02-05 15:38:17,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:17,880 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 915 transitions. [2025-02-05 15:38:17,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 915 transitions. [2025-02-05 15:38:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:38:17,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:17,882 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:17,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:38:17,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:17,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:17,883 INFO L85 PathProgramCache]: Analyzing trace with hash 86736859, now seen corresponding path program 1 times [2025-02-05 15:38:17,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:17,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804321701] [2025-02-05 15:38:17,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:17,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:17,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:38:17,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:38:17,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:17,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:17,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:17,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:17,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804321701] [2025-02-05 15:38:17,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804321701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:17,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:18,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:18,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983904486] [2025-02-05 15:38:18,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:18,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:18,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:18,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:18,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:18,001 INFO L87 Difference]: Start difference. First operand 565 states and 915 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:18,050 INFO L93 Difference]: Finished difference Result 1114 states and 1816 transitions. [2025-02-05 15:38:18,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:38:18,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-02-05 15:38:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:18,057 INFO L225 Difference]: With dead ends: 1114 [2025-02-05 15:38:18,058 INFO L226 Difference]: Without dead ends: 565 [2025-02-05 15:38:18,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:18,062 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 12 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:18,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2700 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2025-02-05 15:38:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2025-02-05 15:38:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 431 states have (on average 1.6264501160092808) internal successors, (701), 449 states have internal predecessors, (701), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-05 15:38:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 914 transitions. [2025-02-05 15:38:18,089 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 914 transitions. Word has length 74 [2025-02-05 15:38:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:18,090 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 914 transitions. [2025-02-05 15:38:18,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:38:18,090 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 914 transitions. [2025-02-05 15:38:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:38:18,091 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:18,091 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:18,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:38:18,092 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:18,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -247710880, now seen corresponding path program 1 times [2025-02-05 15:38:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:18,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597459745] [2025-02-05 15:38:18,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:18,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:38:18,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:38:18,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:18,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:38:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597459745] [2025-02-05 15:38:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597459745] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398812115] [2025-02-05 15:38:18,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:18,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:18,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:18,328 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:38:18,330 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:38:18,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:38:18,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:38:18,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:18,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:18,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:38:18,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:18,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398812115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:18,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:18,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 15:38:18,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728203305] [2025-02-05 15:38:18,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:18,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:18,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:18,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:18,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:18,733 INFO L87 Difference]: Start difference. First operand 565 states and 914 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:18,807 INFO L93 Difference]: Finished difference Result 1606 states and 2630 transitions. [2025-02-05 15:38:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:18,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-02-05 15:38:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:18,819 INFO L225 Difference]: With dead ends: 1606 [2025-02-05 15:38:18,820 INFO L226 Difference]: Without dead ends: 1059 [2025-02-05 15:38:18,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:18,825 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 876 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:18,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1731 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2025-02-05 15:38:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1044. [2025-02-05 15:38:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 804 states have (on average 1.6393034825870647) internal successors, (1318), 839 states have internal predecessors, (1318), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 183 states have call predecessors, (193), 188 states have call successors, (193) [2025-02-05 15:38:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1702 transitions. [2025-02-05 15:38:18,878 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1702 transitions. Word has length 75 [2025-02-05 15:38:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:18,879 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1702 transitions. [2025-02-05 15:38:18,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1702 transitions. [2025-02-05 15:38:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-05 15:38:18,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:18,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:18,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:38:19,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:38:19,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:19,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash -374189112, now seen corresponding path program 1 times [2025-02-05 15:38:19,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:19,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790324259] [2025-02-05 15:38:19,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:19,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:19,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:38:19,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:38:19,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:19,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:38:19,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:19,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790324259] [2025-02-05 15:38:19,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790324259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:19,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691459079] [2025-02-05 15:38:19,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:19,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:19,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:19,333 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:38:19,336 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:38:19,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-05 15:38:19,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-05 15:38:19,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:19,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:19,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:38:19,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:19,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:19,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691459079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:19,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:19,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-02-05 15:38:19,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026168571] [2025-02-05 15:38:19,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:19,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:38:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:19,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:38:19,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:19,750 INFO L87 Difference]: Start difference. First operand 1044 states and 1702 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:19,852 INFO L93 Difference]: Finished difference Result 2564 states and 4208 transitions. [2025-02-05 15:38:19,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:38:19,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-02-05 15:38:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:19,867 INFO L225 Difference]: With dead ends: 2564 [2025-02-05 15:38:19,868 INFO L226 Difference]: Without dead ends: 1538 [2025-02-05 15:38:19,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:38:19,875 INFO L435 NwaCegarLoop]: 981 mSDtfsCounter, 875 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:19,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1789 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:38:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-02-05 15:38:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1490. [2025-02-05 15:38:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1150 states have (on average 1.651304347826087) internal successors, (1899), 1202 states have internal predecessors, (1899), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 261 states have call predecessors, (278), 268 states have call successors, (278) [2025-02-05 15:38:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2448 transitions. [2025-02-05 15:38:19,962 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2448 transitions. Word has length 76 [2025-02-05 15:38:19,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:19,963 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 2448 transitions. [2025-02-05 15:38:19,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:38:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2448 transitions. [2025-02-05 15:38:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:38:19,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:19,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:19,976 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:38:20,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:20,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash -431761971, now seen corresponding path program 1 times [2025-02-05 15:38:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:20,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612292573] [2025-02-05 15:38:20,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:20,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:38:20,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:38:20,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:20,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612292573] [2025-02-05 15:38:20,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612292573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:20,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525363031] [2025-02-05 15:38:20,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:20,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:20,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:20,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:20,345 INFO L87 Difference]: Start difference. First operand 1490 states and 2448 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:38:21,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:21,046 INFO L93 Difference]: Finished difference Result 4394 states and 7393 transitions. [2025-02-05 15:38:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:21,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-02-05 15:38:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:21,075 INFO L225 Difference]: With dead ends: 4394 [2025-02-05 15:38:21,076 INFO L226 Difference]: Without dead ends: 2922 [2025-02-05 15:38:21,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:21,088 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 910 mSDsluCounter, 3746 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 4792 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:21,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 4792 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2025-02-05 15:38:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2875. [2025-02-05 15:38:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2221 states have (on average 1.6515083295812698) internal successors, (3668), 2321 states have internal predecessors, (3668), 521 states have call successors, (521), 130 states have call predecessors, (521), 132 states have return successors, (637), 507 states have call predecessors, (637), 517 states have call successors, (637) [2025-02-05 15:38:21,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4826 transitions. [2025-02-05 15:38:21,273 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4826 transitions. Word has length 78 [2025-02-05 15:38:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:21,274 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4826 transitions. [2025-02-05 15:38:21,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:38:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4826 transitions. [2025-02-05 15:38:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:38:21,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:21,277 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:21,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:38:21,278 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:21,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash 606800462, now seen corresponding path program 1 times [2025-02-05 15:38:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:21,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155904632] [2025-02-05 15:38:21,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:21,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:21,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:38:21,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:38:21,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:21,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:38:21,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155904632] [2025-02-05 15:38:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155904632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:21,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920007507] [2025-02-05 15:38:21,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:21,537 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:38:21,540 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:38:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:38:21,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:38:21,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:21,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:21,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 15:38:21,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:38:22,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920007507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-02-05 15:38:22,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098771857] [2025-02-05 15:38:22,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:22,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:22,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:22,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:22,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:38:22,046 INFO L87 Difference]: Start difference. First operand 2875 states and 4826 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:38:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:23,144 INFO L93 Difference]: Finished difference Result 7780 states and 13338 transitions. [2025-02-05 15:38:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:23,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-02-05 15:38:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:23,202 INFO L225 Difference]: With dead ends: 7780 [2025-02-05 15:38:23,202 INFO L226 Difference]: Without dead ends: 4923 [2025-02-05 15:38:23,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-05 15:38:23,233 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 777 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:23,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 4121 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 15:38:23,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4923 states. [2025-02-05 15:38:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4923 to 4880. [2025-02-05 15:38:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 3766 states have (on average 1.6059479553903346) internal successors, (6048), 3932 states have internal predecessors, (6048), 874 states have call successors, (874), 232 states have call predecessors, (874), 239 states have return successors, (1207), 855 states have call predecessors, (1207), 868 states have call successors, (1207) [2025-02-05 15:38:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 8129 transitions. [2025-02-05 15:38:23,522 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 8129 transitions. Word has length 79 [2025-02-05 15:38:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:23,522 INFO L471 AbstractCegarLoop]: Abstraction has 4880 states and 8129 transitions. [2025-02-05 15:38:23,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-05 15:38:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 8129 transitions. [2025-02-05 15:38:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:38:23,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:23,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:23,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:38:23,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:23,725 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:23,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:23,725 INFO L85 PathProgramCache]: Analyzing trace with hash -467831463, now seen corresponding path program 1 times [2025-02-05 15:38:23,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385691675] [2025-02-05 15:38:23,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:23,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:38:23,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:38:23,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:23,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:38:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:23,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385691675] [2025-02-05 15:38:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385691675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:23,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:23,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372557715] [2025-02-05 15:38:23,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:23,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:23,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:23,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:23,842 INFO L87 Difference]: Start difference. First operand 4880 states and 8129 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:38:24,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:24,197 INFO L93 Difference]: Finished difference Result 9766 states and 16433 transitions. [2025-02-05 15:38:24,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:24,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-02-05 15:38:24,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:24,240 INFO L225 Difference]: With dead ends: 9766 [2025-02-05 15:38:24,241 INFO L226 Difference]: Without dead ends: 4904 [2025-02-05 15:38:24,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:24,270 INFO L435 NwaCegarLoop]: 897 mSDtfsCounter, 12 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:24,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2664 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2025-02-05 15:38:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4888. [2025-02-05 15:38:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4888 states, 3772 states have (on average 1.6044538706256628) internal successors, (6052), 3938 states have internal predecessors, (6052), 874 states have call successors, (874), 236 states have call predecessors, (874), 241 states have return successors, (1196), 853 states have call predecessors, (1196), 868 states have call successors, (1196) [2025-02-05 15:38:24,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 8122 transitions. [2025-02-05 15:38:24,554 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 8122 transitions. Word has length 79 [2025-02-05 15:38:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:24,557 INFO L471 AbstractCegarLoop]: Abstraction has 4888 states and 8122 transitions. [2025-02-05 15:38:24,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:38:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 8122 transitions. [2025-02-05 15:38:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:38:24,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:24,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:24,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:38:24,560 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:24,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:24,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1287408658, now seen corresponding path program 1 times [2025-02-05 15:38:24,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:24,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926583540] [2025-02-05 15:38:24,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:24,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:24,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:38:24,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:38:24,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:24,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:24,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:38:24,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:24,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926583540] [2025-02-05 15:38:24,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926583540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:24,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:24,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134229627] [2025-02-05 15:38:24,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:24,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:24,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:24,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:24,728 INFO L87 Difference]: Start difference. First operand 4888 states and 8122 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:38:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:25,656 INFO L93 Difference]: Finished difference Result 14597 states and 25277 transitions. [2025-02-05 15:38:25,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:25,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-02-05 15:38:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:25,773 INFO L225 Difference]: With dead ends: 14597 [2025-02-05 15:38:25,774 INFO L226 Difference]: Without dead ends: 9727 [2025-02-05 15:38:25,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:25,808 INFO L435 NwaCegarLoop]: 1014 mSDtfsCounter, 905 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 4674 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:25,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 4674 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 15:38:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9727 states. [2025-02-05 15:38:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9727 to 9658. [2025-02-05 15:38:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9658 states, 7456 states have (on average 1.600456008583691) internal successors, (11933), 7782 states have internal predecessors, (11933), 1720 states have call successors, (1720), 466 states have call predecessors, (1720), 481 states have return successors, (2914), 1689 states have call predecessors, (2914), 1710 states have call successors, (2914) [2025-02-05 15:38:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9658 states to 9658 states and 16567 transitions. [2025-02-05 15:38:26,409 INFO L78 Accepts]: Start accepts. Automaton has 9658 states and 16567 transitions. Word has length 87 [2025-02-05 15:38:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:26,410 INFO L471 AbstractCegarLoop]: Abstraction has 9658 states and 16567 transitions. [2025-02-05 15:38:26,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:38:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 9658 states and 16567 transitions. [2025-02-05 15:38:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 15:38:26,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:26,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:26,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:38:26,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:26,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash -72891041, now seen corresponding path program 1 times [2025-02-05 15:38:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:26,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055990713] [2025-02-05 15:38:26,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:26,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 15:38:26,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 15:38:26,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:26,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:38:26,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:26,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055990713] [2025-02-05 15:38:26,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055990713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:26,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:26,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:26,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979639848] [2025-02-05 15:38:26,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:26,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:26,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:26,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:26,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:26,554 INFO L87 Difference]: Start difference. First operand 9658 states and 16567 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:27,202 INFO L93 Difference]: Finished difference Result 19370 states and 33707 transitions. [2025-02-05 15:38:27,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:27,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-02-05 15:38:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:27,335 INFO L225 Difference]: With dead ends: 19370 [2025-02-05 15:38:27,336 INFO L226 Difference]: Without dead ends: 9730 [2025-02-05 15:38:27,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:27,401 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 12 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:27,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2655 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:27,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9730 states. [2025-02-05 15:38:27,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9730 to 9698. [2025-02-05 15:38:27,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9698 states, 7492 states have (on average 1.5981046449546183) internal successors, (11973), 7810 states have internal predecessors, (11973), 1720 states have call successors, (1720), 482 states have call predecessors, (1720), 485 states have return successors, (2898), 1685 states have call predecessors, (2898), 1710 states have call successors, (2898) [2025-02-05 15:38:27,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9698 states to 9698 states and 16591 transitions. [2025-02-05 15:38:28,009 INFO L78 Accepts]: Start accepts. Automaton has 9698 states and 16591 transitions. Word has length 88 [2025-02-05 15:38:28,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:28,009 INFO L471 AbstractCegarLoop]: Abstraction has 9698 states and 16591 transitions. [2025-02-05 15:38:28,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:38:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 9698 states and 16591 transitions. [2025-02-05 15:38:28,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:38:28,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:28,012 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:28,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:38:28,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:28,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:28,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1053071450, now seen corresponding path program 1 times [2025-02-05 15:38:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98685167] [2025-02-05 15:38:28,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:28,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:38:28,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:38:28,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:28,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:28,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:38:28,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:28,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98685167] [2025-02-05 15:38:28,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98685167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:28,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:28,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:28,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138293651] [2025-02-05 15:38:28,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:28,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:28,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:28,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:28,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:28,197 INFO L87 Difference]: Start difference. First operand 9698 states and 16591 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:38:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:29,456 INFO L93 Difference]: Finished difference Result 29105 states and 52866 transitions. [2025-02-05 15:38:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-02-05 15:38:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:29,698 INFO L225 Difference]: With dead ends: 29105 [2025-02-05 15:38:29,698 INFO L226 Difference]: Without dead ends: 19425 [2025-02-05 15:38:29,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:29,777 INFO L435 NwaCegarLoop]: 1020 mSDtfsCounter, 901 mSDsluCounter, 3688 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 4708 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:29,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 4708 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:38:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19425 states. [2025-02-05 15:38:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19425 to 19324. [2025-02-05 15:38:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19324 states, 14932 states have (on average 1.5946289847307795) internal successors, (23811), 15562 states have internal predecessors, (23811), 3418 states have call successors, (3418), 958 states have call predecessors, (3418), 973 states have return successors, (7478), 3363 states have call predecessors, (7478), 3400 states have call successors, (7478) [2025-02-05 15:38:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19324 states to 19324 states and 34707 transitions. [2025-02-05 15:38:30,979 INFO L78 Accepts]: Start accepts. Automaton has 19324 states and 34707 transitions. Word has length 97 [2025-02-05 15:38:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:30,980 INFO L471 AbstractCegarLoop]: Abstraction has 19324 states and 34707 transitions. [2025-02-05 15:38:30,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:38:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 19324 states and 34707 transitions. [2025-02-05 15:38:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:38:30,983 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:30,983 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:30,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:38:30,983 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:30,984 INFO L85 PathProgramCache]: Analyzing trace with hash -248188242, now seen corresponding path program 1 times [2025-02-05 15:38:30,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046721749] [2025-02-05 15:38:30,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:30,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:31,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:38:31,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:38:31,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:31,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:38:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046721749] [2025-02-05 15:38:31,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046721749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:31,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799198201] [2025-02-05 15:38:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:31,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:31,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:31,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:31,099 INFO L87 Difference]: Start difference. First operand 19324 states and 34707 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:38:32,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:32,244 INFO L93 Difference]: Finished difference Result 38774 states and 71249 transitions. [2025-02-05 15:38:32,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:38:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-02-05 15:38:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:32,697 INFO L225 Difference]: With dead ends: 38774 [2025-02-05 15:38:32,697 INFO L226 Difference]: Without dead ends: 19468 [2025-02-05 15:38:32,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:38:32,807 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 11 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:32,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2658 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:38:32,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19468 states. [2025-02-05 15:38:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19468 to 19404. [2025-02-05 15:38:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19404 states, 15004 states have (on average 1.5923087176752866) internal successors, (23891), 15634 states have internal predecessors, (23891), 3418 states have call successors, (3418), 974 states have call predecessors, (3418), 981 states have return successors, (7458), 3355 states have call predecessors, (7458), 3400 states have call successors, (7458) [2025-02-05 15:38:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19404 states to 19404 states and 34767 transitions. [2025-02-05 15:38:33,840 INFO L78 Accepts]: Start accepts. Automaton has 19404 states and 34767 transitions. Word has length 98 [2025-02-05 15:38:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:33,840 INFO L471 AbstractCegarLoop]: Abstraction has 19404 states and 34767 transitions. [2025-02-05 15:38:33,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:38:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19404 states and 34767 transitions. [2025-02-05 15:38:33,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:38:33,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:33,844 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:33,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:38:33,844 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:33,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:33,845 INFO L85 PathProgramCache]: Analyzing trace with hash -884546476, now seen corresponding path program 1 times [2025-02-05 15:38:33,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:33,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891611506] [2025-02-05 15:38:33,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:33,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:33,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:38:33,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:38:33,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:33,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:38:34,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:34,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891611506] [2025-02-05 15:38:34,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891611506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:34,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:34,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:38:34,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937634411] [2025-02-05 15:38:34,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:34,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:38:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:34,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:38:34,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:38:34,007 INFO L87 Difference]: Start difference. First operand 19404 states and 34767 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:38:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:36,077 INFO L93 Difference]: Finished difference Result 58349 states and 114755 transitions. [2025-02-05 15:38:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:38:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:38:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:36,692 INFO L225 Difference]: With dead ends: 58349 [2025-02-05 15:38:36,692 INFO L226 Difference]: Without dead ends: 38963 [2025-02-05 15:38:36,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:38:36,918 INFO L435 NwaCegarLoop]: 1018 mSDtfsCounter, 896 mSDsluCounter, 3696 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 4714 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:36,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 4714 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:38:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38963 states. [2025-02-05 15:38:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38963 to 38798. [2025-02-05 15:38:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38798 states, 30004 states have (on average 1.5898213571523796) internal successors, (47701), 31258 states have internal predecessors, (47701), 6820 states have call successors, (6820), 1942 states have call predecessors, (6820), 1973 states have return successors, (20622), 6717 states have call predecessors, (20622), 6786 states have call successors, (20622) [2025-02-05 15:38:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38798 states to 38798 states and 75143 transitions. [2025-02-05 15:38:39,433 INFO L78 Accepts]: Start accepts. Automaton has 38798 states and 75143 transitions. Word has length 108 [2025-02-05 15:38:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:39,434 INFO L471 AbstractCegarLoop]: Abstraction has 38798 states and 75143 transitions. [2025-02-05 15:38:39,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:38:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 38798 states and 75143 transitions. [2025-02-05 15:38:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 15:38:39,437 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:39,438 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:39,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:38:39,438 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:39,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash -678680440, now seen corresponding path program 1 times [2025-02-05 15:38:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:39,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134007300] [2025-02-05 15:38:39,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:39,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:38:39,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:38:39,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:39,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-05 15:38:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134007300] [2025-02-05 15:38:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134007300] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:38:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64065187] [2025-02-05 15:38:39,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:39,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:38:39,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:38:39,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:38:39,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:38:39,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 15:38:40,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 15:38:40,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:40,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:40,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:38:40,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:38:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:38:40,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:38:40,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64065187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:40,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:38:40,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-02-05 15:38:40,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785580580] [2025-02-05 15:38:40,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:40,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:38:40,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:40,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:38:40,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:38:40,369 INFO L87 Difference]: Start difference. First operand 38798 states and 75143 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:38:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:38:49,332 INFO L93 Difference]: Finished difference Result 138509 states and 292363 transitions. [2025-02-05 15:38:49,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:38:49,332 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 137 [2025-02-05 15:38:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:38:51,192 INFO L225 Difference]: With dead ends: 138509 [2025-02-05 15:38:51,192 INFO L226 Difference]: Without dead ends: 99729 [2025-02-05 15:38:51,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-02-05 15:38:51,537 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 2580 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 6864 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2758 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 7381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 6864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:38:51,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2758 Valid, 2619 Invalid, 7381 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [517 Valid, 6864 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-05 15:38:51,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99729 states. [2025-02-05 15:38:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99729 to 98456. [2025-02-05 15:38:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98456 states, 76218 states have (on average 1.583418615025322) internal successors, (120685), 79256 states have internal predecessors, (120685), 17064 states have call successors, (17064), 4838 states have call predecessors, (17064), 5173 states have return successors, (64132), 17097 states have call predecessors, (64132), 16998 states have call successors, (64132) [2025-02-05 15:38:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98456 states to 98456 states and 201881 transitions. [2025-02-05 15:38:57,003 INFO L78 Accepts]: Start accepts. Automaton has 98456 states and 201881 transitions. Word has length 137 [2025-02-05 15:38:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:38:57,003 INFO L471 AbstractCegarLoop]: Abstraction has 98456 states and 201881 transitions. [2025-02-05 15:38:57,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2025-02-05 15:38:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 98456 states and 201881 transitions. [2025-02-05 15:38:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:38:57,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:38:57,005 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:38:57,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:38:57,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-05 15:38:57,206 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:38:57,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:38:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1831302599, now seen corresponding path program 1 times [2025-02-05 15:38:57,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:38:57,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252032237] [2025-02-05 15:38:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:38:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:38:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:38:57,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:38:57,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:38:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:38:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:38:57,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:38:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252032237] [2025-02-05 15:38:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252032237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:38:57,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:38:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:38:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048198406] [2025-02-05 15:38:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:38:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:38:57,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:38:57,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:38:57,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:38:57,297 INFO L87 Difference]: Start difference. First operand 98456 states and 201881 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:39:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:39:04,730 INFO L93 Difference]: Finished difference Result 197790 states and 426174 transitions. [2025-02-05 15:39:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:39:04,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-02-05 15:39:04,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:39:05,826 INFO L225 Difference]: With dead ends: 197790 [2025-02-05 15:39:05,826 INFO L226 Difference]: Without dead ends: 99352 [2025-02-05 15:39:06,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:39:06,837 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 10 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:39:06,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2655 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:39:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99352 states.