./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec1_product01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec1_product01.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a24bdc0807d94f83606acfe112db107808ae7409e0ad1ecc1d01e9704d0b4ece --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:12:57,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:12:57,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:12:57,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:12:57,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:12:57,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:12:57,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:12:57,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:12:57,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:12:57,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:12:57,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:12:57,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:12:57,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:12:57,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:12:57,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:12:57,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:12:57,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:12:57,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:12:57,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:12:57,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:12:57,863 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a24bdc0807d94f83606acfe112db107808ae7409e0ad1ecc1d01e9704d0b4ece [2025-03-03 14:12:58,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:12:58,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:12:58,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:12:58,099 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:12:58,099 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:12:58,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec1_product01.cil.c [2025-03-03 14:12:59,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c00961b/da26b07b255c43048051aaab596bd0fc/FLAG1146a851b [2025-03-03 14:12:59,488 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:12:59,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product01.cil.c [2025-03-03 14:12:59,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c00961b/da26b07b255c43048051aaab596bd0fc/FLAG1146a851b [2025-03-03 14:12:59,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c00961b/da26b07b255c43048051aaab596bd0fc [2025-03-03 14:12:59,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:12:59,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:12:59,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:12:59,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:12:59,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:12:59,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:12:59" (1/1) ... [2025-03-03 14:12:59,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@490184d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:12:59, skipping insertion in model container [2025-03-03 14:12:59,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:12:59" (1/1) ... [2025-03-03 14:12:59,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:12:59,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product01.cil.c[1545,1558] [2025-03-03 14:13:00,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:13:00,116 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:13:00,123 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-03 14:13:00,124 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [57] [2025-03-03 14:13:00,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1490] [2025-03-03 14:13:00,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1849] [2025-03-03 14:13:00,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2515] [2025-03-03 14:13:00,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2881] [2025-03-03 14:13:00,125 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2894] [2025-03-03 14:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2985] [2025-03-03 14:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3104] [2025-03-03 14:13:00,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification1_spec.i","") [3139] [2025-03-03 14:13:00,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec1_product01.cil.c[1545,1558] [2025-03-03 14:13:00,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:13:00,239 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:13:00,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00 WrapperNode [2025-03-03 14:13:00,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:13:00,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:13:00,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:13:00,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:13:00,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,296 INFO L138 Inliner]: procedures = 88, calls = 329, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 739 [2025-03-03 14:13:00,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:13:00,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:13:00,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:13:00,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:13:00,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,335 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:13:00,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,364 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:13:00,378 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:13:00,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:13:00,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:13:00,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (1/1) ... [2025-03-03 14:13:00,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:13:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:00,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:13:00,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:13:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2025-03-03 14:13:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2025-03-03 14:13:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:13:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:13:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:13:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:13:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:13:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:13:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:13:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:13:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:13:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:13:00,423 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:13:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:13:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:13:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:13:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:13:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:13:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:13:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:13:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:13:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:13:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:13:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:13:00,426 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:13:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:13:00,426 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:13:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:13:00,426 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:13:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:13:00,426 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:13:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:13:00,426 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:13:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:13:00,426 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:13:00,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:13:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:13:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:13:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:13:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:13:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:13:00,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:13:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:13:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:13:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:13:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:13:00,429 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:13:00,429 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:13:00,575 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:13:00,577 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:13:00,621 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3101: #res := ~retValue_acc~23; [2025-03-03 14:13:00,624 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: #res := ~retValue_acc~0; [2025-03-03 14:13:00,911 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L810: #res := ~retValue_acc~8; [2025-03-03 14:13:00,961 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L914: #res := ~retValue_acc~11; [2025-03-03 14:13:00,976 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3062: #res := ~retValue_acc~22; [2025-03-03 14:13:01,069 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L445-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~6#1; [2025-03-03 14:13:01,069 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L458-1: isIdle_#res#1 := isIdle_~retValue_acc~7#1; [2025-03-03 14:13:01,190 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L316-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~3#1; [2025-03-03 14:13:01,190 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L900-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~10#1; [2025-03-03 14:13:01,190 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L273-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~1#1; [2025-03-03 14:13:01,239 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2201: #res := ~retValue_acc~16; [2025-03-03 14:13:01,289 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3136-1: valid_product_#res#1 := valid_product_~retValue_acc~25#1; [2025-03-03 14:13:01,289 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846-1: main_#res#1 := main_~retValue_acc~14#1; [2025-03-03 14:13:01,296 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1960: #res := ~retValue_acc~15; [2025-03-03 14:13:01,298 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: #res := ~retValue_acc~2; [2025-03-03 14:13:01,301 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2512: #res := ~retValue_acc~17; [2025-03-03 14:13:01,412 INFO L? ?]: Removed 409 outVars from TransFormulas that were not future-live. [2025-03-03 14:13:01,412 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:13:01,436 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:13:01,439 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:13:01,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:13:01 BoogieIcfgContainer [2025-03-03 14:13:01,439 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:13:01,441 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:13:01,441 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:13:01,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:13:01,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:12:59" (1/3) ... [2025-03-03 14:13:01,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c444c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:13:01, skipping insertion in model container [2025-03-03 14:13:01,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:13:00" (2/3) ... [2025-03-03 14:13:01,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c444c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:13:01, skipping insertion in model container [2025-03-03 14:13:01,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:13:01" (3/3) ... [2025-03-03 14:13:01,446 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product01.cil.c [2025-03-03 14:13:01,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:13:01,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec1_product01.cil.c that has 22 procedures, 523 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:13:01,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:13:01,523 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;@1ff6ceb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:13:01,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:13:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 411 states have (on average 1.710462287104623) internal successors, (703), 432 states have internal predecessors, (703), 89 states have call successors, (89), 21 states have call predecessors, (89), 21 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-03 14:13:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:13:01,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:01,548 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:01,549 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:01,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash -570577054, now seen corresponding path program 1 times [2025-03-03 14:13:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:01,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934684588] [2025-03-03 14:13:01,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:01,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:13:01,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:13:01,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:01,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:01,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934684588] [2025-03-03 14:13:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934684588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:01,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124975525] [2025-03-03 14:13:01,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:01,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:01,983 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:01,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:13:02,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:13:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:13:02,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:02,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:02,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 1757 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:13:02,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:13:02,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124975525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:02,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2025-03-03 14:13:02,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399061229] [2025-03-03 14:13:02,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:02,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:13:02,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:02,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:13:02,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:13:02,342 INFO L87 Difference]: Start difference. First operand has 523 states, 411 states have (on average 1.710462287104623) internal successors, (703), 432 states have internal predecessors, (703), 89 states have call successors, (89), 21 states have call predecessors, (89), 21 states have return successors, (89), 83 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:13:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:02,393 INFO L93 Difference]: Finished difference Result 544 states and 911 transitions. [2025-03-03 14:13:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:13:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2025-03-03 14:13:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:02,410 INFO L225 Difference]: With dead ends: 544 [2025-03-03 14:13:02,410 INFO L226 Difference]: Without dead ends: 515 [2025-03-03 14:13:02,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:13:02,433 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:02,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-03 14:13:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2025-03-03 14:13:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 405 states have (on average 1.711111111111111) internal successors, (693), 424 states have internal predecessors, (693), 89 states have call successors, (89), 21 states have call predecessors, (89), 20 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-03 14:13:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 866 transitions. [2025-03-03 14:13:02,502 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 866 transitions. Word has length 97 [2025-03-03 14:13:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:02,503 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 866 transitions. [2025-03-03 14:13:02,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:13:02,503 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 866 transitions. [2025-03-03 14:13:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:13:02,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:02,509 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:02,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:02,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:13:02,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:02,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1597618177, now seen corresponding path program 1 times [2025-03-03 14:13:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788126778] [2025-03-03 14:13:02,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:02,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:13:02,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:13:02,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:02,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:02,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788126778] [2025-03-03 14:13:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788126778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:02,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964614592] [2025-03-03 14:13:02,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:02,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:02,916 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:02,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:13:03,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:13:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:13:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:03,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 1760 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:03,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:13:03,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:03,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964614592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:03,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:03,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 14:13:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247396960] [2025-03-03 14:13:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:03,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:13:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:03,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:13:03,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:03,278 INFO L87 Difference]: Start difference. First operand 515 states and 866 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:13:03,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:03,380 INFO L93 Difference]: Finished difference Result 1370 states and 2329 transitions. [2025-03-03 14:13:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:13:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-03 14:13:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:03,391 INFO L225 Difference]: With dead ends: 1370 [2025-03-03 14:13:03,392 INFO L226 Difference]: Without dead ends: 940 [2025-03-03 14:13:03,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:03,397 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 861 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:03,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1613 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-03-03 14:13:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 920. [2025-03-03 14:13:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 723 states have (on average 1.7150760719225449) internal successors, (1240), 755 states have internal predecessors, (1240), 161 states have call successors, (161), 35 states have call predecessors, (161), 35 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1563 transitions. [2025-03-03 14:13:03,464 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1563 transitions. Word has length 99 [2025-03-03 14:13:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:03,464 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1563 transitions. [2025-03-03 14:13:03,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:13:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1563 transitions. [2025-03-03 14:13:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:13:03,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:03,468 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:03,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:13:03,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:13:03,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1452584638, now seen corresponding path program 1 times [2025-03-03 14:13:03,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:03,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32712655] [2025-03-03 14:13:03,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:03,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:03,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:13:03,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:13:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:03,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:03,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32712655] [2025-03-03 14:13:03,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32712655] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:03,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843732768] [2025-03-03 14:13:03,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:03,809 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:03,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:13:03,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:13:04,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:13:04,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:04,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:04,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:04,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:04,118 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843732768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149556347] [2025-03-03 14:13:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:04,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:04,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:04,120 INFO L87 Difference]: Start difference. First operand 920 states and 1563 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:04,213 INFO L93 Difference]: Finished difference Result 1831 states and 3118 transitions. [2025-03-03 14:13:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-03 14:13:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:04,224 INFO L225 Difference]: With dead ends: 1831 [2025-03-03 14:13:04,224 INFO L226 Difference]: Without dead ends: 920 [2025-03-03 14:13:04,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:04,229 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 5 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:04,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2556 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:04,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-03 14:13:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2025-03-03 14:13:04,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 723 states have (on average 1.7136929460580912) internal successors, (1239), 755 states have internal predecessors, (1239), 161 states have call successors, (161), 35 states have call predecessors, (161), 35 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1562 transitions. [2025-03-03 14:13:04,270 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1562 transitions. Word has length 99 [2025-03-03 14:13:04,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:04,270 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1562 transitions. [2025-03-03 14:13:04,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1562 transitions. [2025-03-03 14:13:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:13:04,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:04,273 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:04,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:04,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:04,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:04,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:04,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1123858832, now seen corresponding path program 1 times [2025-03-03 14:13:04,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:04,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161434874] [2025-03-03 14:13:04,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:04,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:04,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:13:04,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:13:04,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:04,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:04,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:04,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161434874] [2025-03-03 14:13:04,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161434874] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:04,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706642751] [2025-03-03 14:13:04,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:04,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:04,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:04,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:04,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:13:04,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:13:04,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:13:04,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:04,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:04,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:04,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:04,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706642751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:04,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729102009] [2025-03-03 14:13:04,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:04,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:04,850 INFO L87 Difference]: Start difference. First operand 920 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:04,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:04,901 INFO L93 Difference]: Finished difference Result 1831 states and 3116 transitions. [2025-03-03 14:13:04,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:04,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-03-03 14:13:04,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:04,908 INFO L225 Difference]: With dead ends: 1831 [2025-03-03 14:13:04,908 INFO L226 Difference]: Without dead ends: 920 [2025-03-03 14:13:04,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:04,912 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 4 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:04,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2556 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:04,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-03-03 14:13:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2025-03-03 14:13:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 723 states have (on average 1.7123098201936375) internal successors, (1238), 755 states have internal predecessors, (1238), 161 states have call successors, (161), 35 states have call predecessors, (161), 35 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1561 transitions. [2025-03-03 14:13:04,938 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1561 transitions. Word has length 101 [2025-03-03 14:13:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:04,939 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1561 transitions. [2025-03-03 14:13:04,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1561 transitions. [2025-03-03 14:13:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:13:04,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:04,941 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:04,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:13:05,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:05,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:05,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 177548318, now seen corresponding path program 1 times [2025-03-03 14:13:05,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:05,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686605337] [2025-03-03 14:13:05,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:05,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:05,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:13:05,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:13:05,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:05,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686605337] [2025-03-03 14:13:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686605337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294739112] [2025-03-03 14:13:05,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:05,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:05,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:05,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:05,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:13:05,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:13:05,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:13:05,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:05,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:05,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:05,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:05,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:05,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294739112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:05,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:05,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:05,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379415342] [2025-03-03 14:13:05,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:05,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:05,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:05,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:05,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:05,520 INFO L87 Difference]: Start difference. First operand 920 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:05,585 INFO L93 Difference]: Finished difference Result 1838 states and 3123 transitions. [2025-03-03 14:13:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:05,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2025-03-03 14:13:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:05,591 INFO L225 Difference]: With dead ends: 1838 [2025-03-03 14:13:05,591 INFO L226 Difference]: Without dead ends: 929 [2025-03-03 14:13:05,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:05,595 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 13 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:05,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2553 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:05,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-03 14:13:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2025-03-03 14:13:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 731 states have (on average 1.7099863201094392) internal successors, (1250), 763 states have internal predecessors, (1250), 161 states have call successors, (161), 36 states have call predecessors, (161), 36 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1573 transitions. [2025-03-03 14:13:05,624 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1573 transitions. Word has length 103 [2025-03-03 14:13:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:05,625 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1573 transitions. [2025-03-03 14:13:05,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1573 transitions. [2025-03-03 14:13:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:13:05,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:05,627 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:05,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:05,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:05,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:05,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1409861779, now seen corresponding path program 1 times [2025-03-03 14:13:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:05,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386957401] [2025-03-03 14:13:05,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:05,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:13:05,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:13:05,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:05,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:05,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386957401] [2025-03-03 14:13:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386957401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976744612] [2025-03-03 14:13:05,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:05,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:05,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:05,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:05,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:13:06,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:13:06,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:13:06,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:06,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:06,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 1766 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:06,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:06,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:06,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976744612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:06,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:06,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:06,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954835289] [2025-03-03 14:13:06,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:06,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:06,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:06,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:06,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:06,217 INFO L87 Difference]: Start difference. First operand 929 states and 1573 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:06,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:06,273 INFO L93 Difference]: Finished difference Result 1840 states and 3124 transitions. [2025-03-03 14:13:06,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:06,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2025-03-03 14:13:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:06,279 INFO L225 Difference]: With dead ends: 1840 [2025-03-03 14:13:06,279 INFO L226 Difference]: Without dead ends: 929 [2025-03-03 14:13:06,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:06,283 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 11 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:06,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2553 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-03 14:13:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2025-03-03 14:13:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 731 states have (on average 1.7086183310533516) internal successors, (1249), 763 states have internal predecessors, (1249), 161 states have call successors, (161), 36 states have call predecessors, (161), 36 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1572 transitions. [2025-03-03 14:13:06,312 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1572 transitions. Word has length 104 [2025-03-03 14:13:06,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:06,312 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1572 transitions. [2025-03-03 14:13:06,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1572 transitions. [2025-03-03 14:13:06,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:13:06,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:06,314 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:06,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:06,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:06,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1342397247, now seen corresponding path program 1 times [2025-03-03 14:13:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:06,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169830255] [2025-03-03 14:13:06,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:06,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:06,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:13:06,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:13:06,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:06,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169830255] [2025-03-03 14:13:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169830255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348175735] [2025-03-03 14:13:06,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:06,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:06,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:06,599 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:06,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:13:06,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:13:06,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:13:06,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:06,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:06,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 1767 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:06,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:06,877 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:06,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:06,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348175735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:06,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:06,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:06,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813714419] [2025-03-03 14:13:06,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:06,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:06,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:06,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:06,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:06,879 INFO L87 Difference]: Start difference. First operand 929 states and 1572 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:06,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:06,943 INFO L93 Difference]: Finished difference Result 1840 states and 3123 transitions. [2025-03-03 14:13:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:06,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-03-03 14:13:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:06,950 INFO L225 Difference]: With dead ends: 1840 [2025-03-03 14:13:06,950 INFO L226 Difference]: Without dead ends: 929 [2025-03-03 14:13:06,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:06,955 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 10 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:06,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2553 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2025-03-03 14:13:06,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2025-03-03 14:13:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 731 states have (on average 1.707250341997264) internal successors, (1248), 763 states have internal predecessors, (1248), 161 states have call successors, (161), 36 states have call predecessors, (161), 36 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1571 transitions. [2025-03-03 14:13:06,990 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1571 transitions. Word has length 105 [2025-03-03 14:13:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:06,991 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1571 transitions. [2025-03-03 14:13:06,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1571 transitions. [2025-03-03 14:13:06,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:13:06,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:06,993 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:07,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:07,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:07,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:07,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:07,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1513426768, now seen corresponding path program 1 times [2025-03-03 14:13:07,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:07,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526907193] [2025-03-03 14:13:07,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:07,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:07,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:13:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:13:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:07,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526907193] [2025-03-03 14:13:07,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526907193] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:07,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248893214] [2025-03-03 14:13:07,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:07,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:07,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:07,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:07,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:13:07,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:13:07,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:13:07,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:07,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:07,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:07,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:13:07,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:07,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248893214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:07,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:07,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:13:07,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276732614] [2025-03-03 14:13:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:07,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:07,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:07,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:07,632 INFO L87 Difference]: Start difference. First operand 929 states and 1571 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:07,770 INFO L93 Difference]: Finished difference Result 1866 states and 3170 transitions. [2025-03-03 14:13:07,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:07,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2025-03-03 14:13:07,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:07,776 INFO L225 Difference]: With dead ends: 1866 [2025-03-03 14:13:07,776 INFO L226 Difference]: Without dead ends: 944 [2025-03-03 14:13:07,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:07,779 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 76 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:07,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 2444 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-03 14:13:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 929. [2025-03-03 14:13:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 731 states have (on average 1.7004103967168263) internal successors, (1243), 763 states have internal predecessors, (1243), 161 states have call successors, (161), 36 states have call predecessors, (161), 36 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1566 transitions. [2025-03-03 14:13:07,805 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1566 transitions. Word has length 106 [2025-03-03 14:13:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:07,805 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1566 transitions. [2025-03-03 14:13:07,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:07,805 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1566 transitions. [2025-03-03 14:13:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:13:07,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:07,807 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:07,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:08,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-03 14:13:08,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:08,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:08,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1687635642, now seen corresponding path program 1 times [2025-03-03 14:13:08,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:08,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960976122] [2025-03-03 14:13:08,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:08,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:08,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:13:08,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:13:08,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:08,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:08,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960976122] [2025-03-03 14:13:08,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960976122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:08,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871882680] [2025-03-03 14:13:08,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:08,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:08,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:08,167 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:08,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:13:08,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:13:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:13:08,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:08,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:08,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:08,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:13:08,435 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:08,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871882680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:08,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:08,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:13:08,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766156112] [2025-03-03 14:13:08,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:08,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:08,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:08,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:08,436 INFO L87 Difference]: Start difference. First operand 929 states and 1566 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:08,540 INFO L93 Difference]: Finished difference Result 1866 states and 3160 transitions. [2025-03-03 14:13:08,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:08,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-03 14:13:08,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:08,546 INFO L225 Difference]: With dead ends: 1866 [2025-03-03 14:13:08,547 INFO L226 Difference]: Without dead ends: 944 [2025-03-03 14:13:08,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:08,550 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 75 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2444 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:08,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2444 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-03 14:13:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 929. [2025-03-03 14:13:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 731 states have (on average 1.6935704514363885) internal successors, (1238), 763 states have internal predecessors, (1238), 161 states have call successors, (161), 36 states have call predecessors, (161), 36 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1561 transitions. [2025-03-03 14:13:08,599 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1561 transitions. Word has length 108 [2025-03-03 14:13:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:08,599 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1561 transitions. [2025-03-03 14:13:08,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1561 transitions. [2025-03-03 14:13:08,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:13:08,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:08,601 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:08,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 14:13:08,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:08,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -173250032, now seen corresponding path program 1 times [2025-03-03 14:13:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769115312] [2025-03-03 14:13:08,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:08,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:13:08,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:13:08,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:08,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769115312] [2025-03-03 14:13:08,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769115312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:08,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833312904] [2025-03-03 14:13:08,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:08,956 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:08,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:13:09,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:13:09,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:13:09,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:09,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:09,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:09,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:13:09,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833312904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:09,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:09,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:13:09,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27017336] [2025-03-03 14:13:09,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:09,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:09,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:09,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:09,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:09,230 INFO L87 Difference]: Start difference. First operand 929 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:09,370 INFO L93 Difference]: Finished difference Result 1917 states and 3233 transitions. [2025-03-03 14:13:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:09,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2025-03-03 14:13:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:09,376 INFO L225 Difference]: With dead ends: 1917 [2025-03-03 14:13:09,377 INFO L226 Difference]: Without dead ends: 1010 [2025-03-03 14:13:09,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:13:09,380 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 130 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:09,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2475 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:09,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-03 14:13:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 980. [2025-03-03 14:13:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 781 states have (on average 1.6939820742637643) internal successors, (1323), 813 states have internal predecessors, (1323), 161 states have call successors, (161), 37 states have call predecessors, (161), 37 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:09,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1646 transitions. [2025-03-03 14:13:09,405 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1646 transitions. Word has length 110 [2025-03-03 14:13:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:09,405 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1646 transitions. [2025-03-03 14:13:09,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1646 transitions. [2025-03-03 14:13:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:13:09,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:09,408 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:09,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:09,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:13:09,609 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:09,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 864562901, now seen corresponding path program 1 times [2025-03-03 14:13:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:09,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363334477] [2025-03-03 14:13:09,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:13:09,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:13:09,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:09,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:09,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363334477] [2025-03-03 14:13:09,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363334477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:09,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426827049] [2025-03-03 14:13:09,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:09,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:09,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:09,788 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:09,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:13:09,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:13:10,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:13:10,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:10,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:10,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 1773 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:10,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:13:10,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426827049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-03 14:13:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704225018] [2025-03-03 14:13:10,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:10,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:10,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:10,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:10,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:10,067 INFO L87 Difference]: Start difference. First operand 980 states and 1646 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:10,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:10,205 INFO L93 Difference]: Finished difference Result 1932 states and 3257 transitions. [2025-03-03 14:13:10,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:10,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2025-03-03 14:13:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:10,211 INFO L225 Difference]: With dead ends: 1932 [2025-03-03 14:13:10,211 INFO L226 Difference]: Without dead ends: 1010 [2025-03-03 14:13:10,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:13:10,215 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 124 mSDsluCounter, 1588 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:10,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 2448 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2025-03-03 14:13:10,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 980. [2025-03-03 14:13:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 781 states have (on average 1.6875800256081945) internal successors, (1318), 813 states have internal predecessors, (1318), 161 states have call successors, (161), 37 states have call predecessors, (161), 37 states have return successors, (162), 155 states have call predecessors, (162), 156 states have call successors, (162) [2025-03-03 14:13:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1641 transitions. [2025-03-03 14:13:10,242 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1641 transitions. Word has length 111 [2025-03-03 14:13:10,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:10,242 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1641 transitions. [2025-03-03 14:13:10,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1641 transitions. [2025-03-03 14:13:10,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:13:10,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:10,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:10,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:10,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:13:10,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:10,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:10,446 INFO L85 PathProgramCache]: Analyzing trace with hash -724642095, now seen corresponding path program 1 times [2025-03-03 14:13:10,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:10,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861342354] [2025-03-03 14:13:10,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:10,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:10,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:13:10,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:13:10,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:10,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861342354] [2025-03-03 14:13:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861342354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080784674] [2025-03-03 14:13:10,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:10,584 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:10,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:13:10,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:13:10,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:13:10,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:10,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:13:10,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:13:10,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080784674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-03 14:13:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470778027] [2025-03-03 14:13:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:13:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:10,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:13:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:13:10,920 INFO L87 Difference]: Start difference. First operand 980 states and 1641 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:11,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:11,038 INFO L93 Difference]: Finished difference Result 1925 states and 3237 transitions. [2025-03-03 14:13:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:13:11,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2025-03-03 14:13:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:11,044 INFO L225 Difference]: With dead ends: 1925 [2025-03-03 14:13:11,044 INFO L226 Difference]: Without dead ends: 1018 [2025-03-03 14:13:11,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:13:11,048 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 113 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 5749 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:11,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 5749 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-03 14:13:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 999. [2025-03-03 14:13:11,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 797 states have (on average 1.6863237139272271) internal successors, (1344), 831 states have internal predecessors, (1344), 162 states have call successors, (162), 37 states have call predecessors, (162), 39 states have return successors, (165), 156 states have call predecessors, (165), 157 states have call successors, (165) [2025-03-03 14:13:11,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1671 transitions. [2025-03-03 14:13:11,079 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1671 transitions. Word has length 111 [2025-03-03 14:13:11,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:11,079 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1671 transitions. [2025-03-03 14:13:11,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1671 transitions. [2025-03-03 14:13:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:13:11,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:11,082 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:11,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:11,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:13:11,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:11,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1534129552, now seen corresponding path program 1 times [2025-03-03 14:13:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:11,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776082500] [2025-03-03 14:13:11,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:11,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:13:11,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:13:11,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:11,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:11,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776082500] [2025-03-03 14:13:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776082500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150705603] [2025-03-03 14:13:11,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:11,345 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:11,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:13:11,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:13:11,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:13:11,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:11,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:11,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:13:11,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:11,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150705603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-03 14:13:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481612136] [2025-03-03 14:13:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:11,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:11,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:11,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:11,624 INFO L87 Difference]: Start difference. First operand 999 states and 1671 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:11,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:11,711 INFO L93 Difference]: Finished difference Result 1863 states and 3137 transitions. [2025-03-03 14:13:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:13:11,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 111 [2025-03-03 14:13:11,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:11,716 INFO L225 Difference]: With dead ends: 1863 [2025-03-03 14:13:11,716 INFO L226 Difference]: Without dead ends: 1023 [2025-03-03 14:13:11,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:11,719 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 86 mSDsluCounter, 4156 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:11,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 5003 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-03-03 14:13:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1018. [2025-03-03 14:13:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 813 states have (on average 1.6851168511685117) internal successors, (1370), 849 states have internal predecessors, (1370), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1701 transitions. [2025-03-03 14:13:11,746 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1701 transitions. Word has length 111 [2025-03-03 14:13:11,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:11,746 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1701 transitions. [2025-03-03 14:13:11,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:11,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1701 transitions. [2025-03-03 14:13:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:13:11,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:11,749 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:11,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:11,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:13:11,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:11,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash -645314394, now seen corresponding path program 1 times [2025-03-03 14:13:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710960213] [2025-03-03 14:13:11,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:11,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:13:11,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:13:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:11,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:13:12,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710960213] [2025-03-03 14:13:12,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710960213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:12,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105965509] [2025-03-03 14:13:12,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:12,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:12,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:12,004 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:12,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:13:12,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:13:12,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:13:12,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:12,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:12,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:13:12,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:12,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105965509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-03 14:13:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731973062] [2025-03-03 14:13:12,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:12,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:12,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:12,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:12,271 INFO L87 Difference]: Start difference. First operand 1018 states and 1701 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:12,344 INFO L93 Difference]: Finished difference Result 1893 states and 3188 transitions. [2025-03-03 14:13:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:13:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2025-03-03 14:13:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:12,351 INFO L225 Difference]: With dead ends: 1893 [2025-03-03 14:13:12,351 INFO L226 Difference]: Without dead ends: 1053 [2025-03-03 14:13:12,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:12,355 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 95 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:12,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 4993 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2025-03-03 14:13:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1018. [2025-03-03 14:13:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 813 states have (on average 1.6851168511685117) internal successors, (1370), 849 states have internal predecessors, (1370), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1701 transitions. [2025-03-03 14:13:12,386 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1701 transitions. Word has length 112 [2025-03-03 14:13:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:12,386 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1701 transitions. [2025-03-03 14:13:12,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1701 transitions. [2025-03-03 14:13:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:13:12,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:12,389 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-03 14:13:12,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 14:13:12,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:12,589 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:12,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:12,590 INFO L85 PathProgramCache]: Analyzing trace with hash 219166485, now seen corresponding path program 1 times [2025-03-03 14:13:12,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:12,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736611403] [2025-03-03 14:13:12,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:12,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:12,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:13:12,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:13:12,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:12,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:13:12,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736611403] [2025-03-03 14:13:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736611403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466856425] [2025-03-03 14:13:12,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:12,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:12,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:12,643 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:12,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:13:12,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:13:12,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:13:12,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:12,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:12,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1765 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:13:12,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:12,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466856425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:12,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-03 14:13:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956622756] [2025-03-03 14:13:12,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:12,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:13:12,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:12,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:13:12,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:12,940 INFO L87 Difference]: Start difference. First operand 1018 states and 1701 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:13,066 INFO L93 Difference]: Finished difference Result 1878 states and 3162 transitions. [2025-03-03 14:13:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:13:13,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2025-03-03 14:13:13,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:13,071 INFO L225 Difference]: With dead ends: 1878 [2025-03-03 14:13:13,071 INFO L226 Difference]: Without dead ends: 1038 [2025-03-03 14:13:13,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:13:13,075 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 113 mSDsluCounter, 4921 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 5757 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:13,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 5757 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2025-03-03 14:13:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1018. [2025-03-03 14:13:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 813 states have (on average 1.6851168511685117) internal successors, (1370), 849 states have internal predecessors, (1370), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1701 transitions. [2025-03-03 14:13:13,100 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1701 transitions. Word has length 112 [2025-03-03 14:13:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:13,101 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1701 transitions. [2025-03-03 14:13:13,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1701 transitions. [2025-03-03 14:13:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:13:13,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:13,103 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:13,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:13,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:13:13,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1280261267, now seen corresponding path program 1 times [2025-03-03 14:13:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940381090] [2025-03-03 14:13:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:13,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:13:13,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:13:13,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:13,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:13,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940381090] [2025-03-03 14:13:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940381090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:13,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867638528] [2025-03-03 14:13:13,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:13,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:13,364 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:13,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:13:13,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:13:13,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:13:13,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:13,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:13,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 1769 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:13,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:13:13,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867638528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:13,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383158107] [2025-03-03 14:13:13,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:13,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:13,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:13,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:13,599 INFO L87 Difference]: Start difference. First operand 1018 states and 1701 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:13,637 INFO L93 Difference]: Finished difference Result 1930 states and 3247 transitions. [2025-03-03 14:13:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-03 14:13:13,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:13,642 INFO L225 Difference]: With dead ends: 1930 [2025-03-03 14:13:13,642 INFO L226 Difference]: Without dead ends: 1018 [2025-03-03 14:13:13,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:13,645 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 13 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:13,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2522 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-03 14:13:13,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-03-03 14:13:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 813 states have (on average 1.6801968019680196) internal successors, (1366), 849 states have internal predecessors, (1366), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:13,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1697 transitions. [2025-03-03 14:13:13,672 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1697 transitions. Word has length 112 [2025-03-03 14:13:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:13,672 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1697 transitions. [2025-03-03 14:13:13,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1697 transitions. [2025-03-03 14:13:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:13:13,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:13,674 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:13,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-03 14:13:13,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:13:13,874 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 620441881, now seen corresponding path program 1 times [2025-03-03 14:13:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96840760] [2025-03-03 14:13:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:13,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:13:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:13:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:13,935 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:13:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96840760] [2025-03-03 14:13:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96840760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932105555] [2025-03-03 14:13:13,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:13,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:13,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:13,937 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:13,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 14:13:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:13:14,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:13:14,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:14,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:14,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 1766 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:13:14,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:13:14,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932105555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:14,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:14,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993087622] [2025-03-03 14:13:14,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:14,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:14,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:14,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:14,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:14,219 INFO L87 Difference]: Start difference. First operand 1018 states and 1697 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:14,262 INFO L93 Difference]: Finished difference Result 1974 states and 3315 transitions. [2025-03-03 14:13:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:14,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2025-03-03 14:13:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:14,267 INFO L225 Difference]: With dead ends: 1974 [2025-03-03 14:13:14,267 INFO L226 Difference]: Without dead ends: 1042 [2025-03-03 14:13:14,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:14,270 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 7 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2495 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:14,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2495 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2025-03-03 14:13:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2025-03-03 14:13:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 837 states have (on average 1.6654719235364397) internal successors, (1394), 873 states have internal predecessors, (1394), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1725 transitions. [2025-03-03 14:13:14,300 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1725 transitions. Word has length 113 [2025-03-03 14:13:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:14,300 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1725 transitions. [2025-03-03 14:13:14,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:14,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1725 transitions. [2025-03-03 14:13:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:13:14,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:14,306 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:14,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:13:14,507 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:14,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1811457501, now seen corresponding path program 1 times [2025-03-03 14:13:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123838445] [2025-03-03 14:13:14,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:14,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:13:14,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:13:14,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:14,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:13:14,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123838445] [2025-03-03 14:13:14,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123838445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:14,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853558179] [2025-03-03 14:13:14,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:14,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:14,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:14,564 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:14,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 14:13:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:13:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:13:14,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:14,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:14,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 1767 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:13:14,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:14,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853558179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-03 14:13:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074139602] [2025-03-03 14:13:14,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:14,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:13:14,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:14,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:13:14,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:14,833 INFO L87 Difference]: Start difference. First operand 1042 states and 1725 transitions. Second operand has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:14,939 INFO L93 Difference]: Finished difference Result 1908 states and 3194 transitions. [2025-03-03 14:13:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:13:14,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 114 [2025-03-03 14:13:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:14,945 INFO L225 Difference]: With dead ends: 1908 [2025-03-03 14:13:14,945 INFO L226 Difference]: Without dead ends: 1068 [2025-03-03 14:13:14,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:13:14,948 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 119 mSDsluCounter, 4883 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 5713 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:14,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 5713 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:14,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2025-03-03 14:13:14,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1042. [2025-03-03 14:13:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 837 states have (on average 1.6654719235364397) internal successors, (1394), 873 states have internal predecessors, (1394), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1725 transitions. [2025-03-03 14:13:14,976 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1725 transitions. Word has length 114 [2025-03-03 14:13:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:14,976 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1725 transitions. [2025-03-03 14:13:14,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1725 transitions. [2025-03-03 14:13:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:13:14,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:14,979 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:14,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:15,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:13:15,179 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:15,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash -437117655, now seen corresponding path program 1 times [2025-03-03 14:13:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:15,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776196772] [2025-03-03 14:13:15,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:15,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:13:15,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:13:15,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:15,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:15,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776196772] [2025-03-03 14:13:15,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776196772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:15,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287558426] [2025-03-03 14:13:15,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:15,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:15,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:15,237 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:15,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 14:13:15,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:13:15,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:13:15,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:15,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:15,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1770 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:13:15,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:15,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:13:15,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:15,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287558426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:15,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:13:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975677310] [2025-03-03 14:13:15,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:15,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:15,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:15,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:15,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:15,500 INFO L87 Difference]: Start difference. First operand 1042 states and 1725 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:15,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:15,521 INFO L93 Difference]: Finished difference Result 1881 states and 3160 transitions. [2025-03-03 14:13:15,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:15,521 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, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2025-03-03 14:13:15,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:15,526 INFO L225 Difference]: With dead ends: 1881 [2025-03-03 14:13:15,526 INFO L226 Difference]: Without dead ends: 1046 [2025-03-03 14:13:15,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:15,528 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 0 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:15,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2544 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2025-03-03 14:13:15,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1046. [2025-03-03 14:13:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 841 states have (on average 1.66230677764566) internal successors, (1398), 877 states have internal predecessors, (1398), 163 states have call successors, (163), 37 states have call predecessors, (163), 41 states have return successors, (168), 157 states have call predecessors, (168), 158 states have call successors, (168) [2025-03-03 14:13:15,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1729 transitions. [2025-03-03 14:13:15,552 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1729 transitions. Word has length 114 [2025-03-03 14:13:15,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:15,552 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1729 transitions. [2025-03-03 14:13:15,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:15,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1729 transitions. [2025-03-03 14:13:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:13:15,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:15,555 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:15,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-03 14:13:15,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:15,756 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:15,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:15,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1427299807, now seen corresponding path program 1 times [2025-03-03 14:13:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332453241] [2025-03-03 14:13:15,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:15,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:15,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:13:15,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:13:15,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:15,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:15,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:15,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:15,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332453241] [2025-03-03 14:13:15,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332453241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:15,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801791106] [2025-03-03 14:13:15,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:15,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:15,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:15,816 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:15,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 14:13:15,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:13:16,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:13:16,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:16,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:16,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:13:16,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:13:16,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801791106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:16,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 11 [2025-03-03 14:13:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111513632] [2025-03-03 14:13:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:16,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:13:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:16,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:13:16,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:16,197 INFO L87 Difference]: Start difference. First operand 1046 states and 1729 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 5 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:13:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:18,551 INFO L93 Difference]: Finished difference Result 3088 states and 5253 transitions. [2025-03-03 14:13:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:13:18,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 5 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 117 [2025-03-03 14:13:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:18,562 INFO L225 Difference]: With dead ends: 3088 [2025-03-03 14:13:18,562 INFO L226 Difference]: Without dead ends: 2249 [2025-03-03 14:13:18,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:13:18,566 INFO L435 NwaCegarLoop]: 949 mSDtfsCounter, 3404 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 4983 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3526 SdHoareTripleChecker+Valid, 3971 SdHoareTripleChecker+Invalid, 5765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 4983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:18,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3526 Valid, 3971 Invalid, 5765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 4983 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:13:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2025-03-03 14:13:18,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2226. [2025-03-03 14:13:18,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 1737 states have (on average 1.6580310880829014) internal successors, (2880), 1816 states have internal predecessors, (2880), 399 states have call successors, (399), 70 states have call predecessors, (399), 89 states have return successors, (471), 401 states have call predecessors, (471), 394 states have call successors, (471) [2025-03-03 14:13:18,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3750 transitions. [2025-03-03 14:13:18,623 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3750 transitions. Word has length 117 [2025-03-03 14:13:18,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:18,623 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 3750 transitions. [2025-03-03 14:13:18,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 states have internal predecessors, (82), 5 states have call successors, (12), 4 states have call predecessors, (12), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:13:18,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3750 transitions. [2025-03-03 14:13:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:13:18,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:18,628 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:13:18,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:18,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:18,829 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:18,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1499927226, now seen corresponding path program 1 times [2025-03-03 14:13:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:18,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881167413] [2025-03-03 14:13:18,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:18,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:13:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:13:18,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:18,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:13:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:18,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881167413] [2025-03-03 14:13:18,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881167413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:18,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169199059] [2025-03-03 14:13:18,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:18,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:18,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:18,906 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:18,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 14:13:19,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:13:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:13:19,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:19,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:19,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:13:19,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:13:19,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:19,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169199059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:19,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:19,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2025-03-03 14:13:19,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719948077] [2025-03-03 14:13:19,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:19,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:13:19,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:19,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:13:19,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:19,164 INFO L87 Difference]: Start difference. First operand 2226 states and 3750 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:19,484 INFO L93 Difference]: Finished difference Result 5939 states and 10188 transitions. [2025-03-03 14:13:19,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:13:19,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 118 [2025-03-03 14:13:19,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:19,510 INFO L225 Difference]: With dead ends: 5939 [2025-03-03 14:13:19,511 INFO L226 Difference]: Without dead ends: 4032 [2025-03-03 14:13:19,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:13:19,522 INFO L435 NwaCegarLoop]: 1311 mSDtfsCounter, 692 mSDsluCounter, 3286 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:19,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 4597 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:13:19,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2025-03-03 14:13:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 4011. [2025-03-03 14:13:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4011 states, 3096 states have (on average 1.6592377260981912) internal successors, (5137), 3242 states have internal predecessors, (5137), 749 states have call successors, (749), 136 states have call predecessors, (749), 165 states have return successors, (894), 754 states have call predecessors, (894), 744 states have call successors, (894) [2025-03-03 14:13:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4011 states to 4011 states and 6780 transitions. [2025-03-03 14:13:19,635 INFO L78 Accepts]: Start accepts. Automaton has 4011 states and 6780 transitions. Word has length 118 [2025-03-03 14:13:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 4011 states and 6780 transitions. [2025-03-03 14:13:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4011 states and 6780 transitions. [2025-03-03 14:13:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:13:19,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:19,642 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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] [2025-03-03 14:13:19,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:19,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:19,842 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:19,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1561693341, now seen corresponding path program 1 times [2025-03-03 14:13:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767227698] [2025-03-03 14:13:19,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:19,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:13:19,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:13:19,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:19,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767227698] [2025-03-03 14:13:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767227698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816202291] [2025-03-03 14:13:19,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:19,957 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:19,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 14:13:20,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:13:20,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:13:20,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:20,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:20,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1788 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:13:20,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:13:20,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816202291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:20,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-03 14:13:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663405807] [2025-03-03 14:13:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:20,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:20,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:20,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:20,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:20,228 INFO L87 Difference]: Start difference. First operand 4011 states and 6780 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:20,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:20,334 INFO L93 Difference]: Finished difference Result 7860 states and 13341 transitions. [2025-03-03 14:13:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:13:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 120 [2025-03-03 14:13:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:20,359 INFO L225 Difference]: With dead ends: 7860 [2025-03-03 14:13:20,360 INFO L226 Difference]: Without dead ends: 4047 [2025-03-03 14:13:20,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:20,372 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 5 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:20,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2494 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4047 states. [2025-03-03 14:13:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4047 to 4029. [2025-03-03 14:13:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4029 states, 3114 states have (on average 1.6592806679511882) internal successors, (5167), 3260 states have internal predecessors, (5167), 749 states have call successors, (749), 136 states have call predecessors, (749), 165 states have return successors, (894), 754 states have call predecessors, (894), 744 states have call successors, (894) [2025-03-03 14:13:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4029 states to 4029 states and 6810 transitions. [2025-03-03 14:13:20,508 INFO L78 Accepts]: Start accepts. Automaton has 4029 states and 6810 transitions. Word has length 120 [2025-03-03 14:13:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:20,509 INFO L471 AbstractCegarLoop]: Abstraction has 4029 states and 6810 transitions. [2025-03-03 14:13:20,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:13:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 4029 states and 6810 transitions. [2025-03-03 14:13:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:13:20,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:20,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:20,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:20,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:20,721 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:20,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:20,721 INFO L85 PathProgramCache]: Analyzing trace with hash 690600679, now seen corresponding path program 1 times [2025-03-03 14:13:20,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:20,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850973827] [2025-03-03 14:13:20,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:20,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:13:20,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:13:20,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:20,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:20,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850973827] [2025-03-03 14:13:20,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850973827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009729346] [2025-03-03 14:13:20,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:20,836 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:20,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 14:13:20,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:13:21,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:13:21,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:21,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:21,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 14:13:21,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:21,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:21,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:21,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009729346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:21,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-03-03 14:13:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639447079] [2025-03-03 14:13:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:13:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:21,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:13:21,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:13:21,116 INFO L87 Difference]: Start difference. First operand 4029 states and 6810 transitions. Second operand has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:21,260 INFO L93 Difference]: Finished difference Result 7802 states and 13236 transitions. [2025-03-03 14:13:21,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:13:21,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 121 [2025-03-03 14:13:21,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:21,279 INFO L225 Difference]: With dead ends: 7802 [2025-03-03 14:13:21,279 INFO L226 Difference]: Without dead ends: 4099 [2025-03-03 14:13:21,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:13:21,292 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 89 mSDsluCounter, 4904 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 5734 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:21,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 5734 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:21,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2025-03-03 14:13:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4032. [2025-03-03 14:13:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 3116 states have (on average 1.6585365853658536) internal successors, (5168), 3263 states have internal predecessors, (5168), 749 states have call successors, (749), 136 states have call predecessors, (749), 166 states have return successors, (895), 754 states have call predecessors, (895), 744 states have call successors, (895) [2025-03-03 14:13:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 6812 transitions. [2025-03-03 14:13:21,410 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 6812 transitions. Word has length 121 [2025-03-03 14:13:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:21,410 INFO L471 AbstractCegarLoop]: Abstraction has 4032 states and 6812 transitions. [2025-03-03 14:13:21,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:13:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 6812 transitions. [2025-03-03 14:13:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:13:21,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:21,416 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-03-03 14:13:21,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:21,617 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:21,618 INFO L85 PathProgramCache]: Analyzing trace with hash -16948664, now seen corresponding path program 1 times [2025-03-03 14:13:21,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:21,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314863172] [2025-03-03 14:13:21,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:21,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:13:21,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:13:21,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:21,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314863172] [2025-03-03 14:13:21,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314863172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:21,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533225572] [2025-03-03 14:13:21,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:21,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:21,716 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:21,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 14:13:21,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:13:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:13:21,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:21,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:21,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 1789 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:13:21,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:13:22,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533225572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:22,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2025-03-03 14:13:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608786581] [2025-03-03 14:13:22,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:13:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:13:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:22,056 INFO L87 Difference]: Start difference. First operand 4032 states and 6812 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:13:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:22,350 INFO L93 Difference]: Finished difference Result 4305 states and 7282 transitions. [2025-03-03 14:13:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:22,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 121 [2025-03-03 14:13:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:22,370 INFO L225 Difference]: With dead ends: 4305 [2025-03-03 14:13:22,370 INFO L226 Difference]: Without dead ends: 4288 [2025-03-03 14:13:22,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:22,374 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 791 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:22,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1548 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:13:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2025-03-03 14:13:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4056. [2025-03-03 14:13:22,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 3140 states have (on average 1.6535031847133759) internal successors, (5192), 3287 states have internal predecessors, (5192), 749 states have call successors, (749), 136 states have call predecessors, (749), 166 states have return successors, (895), 754 states have call predecessors, (895), 744 states have call successors, (895) [2025-03-03 14:13:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 6836 transitions. [2025-03-03 14:13:22,477 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 6836 transitions. Word has length 121 [2025-03-03 14:13:22,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:22,478 INFO L471 AbstractCegarLoop]: Abstraction has 4056 states and 6836 transitions. [2025-03-03 14:13:22,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-03 14:13:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 6836 transitions. [2025-03-03 14:13:22,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:13:22,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:22,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:22,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:22,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:22,685 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:22,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:22,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1160508986, now seen corresponding path program 1 times [2025-03-03 14:13:22,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:22,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144748079] [2025-03-03 14:13:22,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:22,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:22,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:13:22,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:13:22,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:22,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:13:22,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144748079] [2025-03-03 14:13:22,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144748079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:22,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289141690] [2025-03-03 14:13:22,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:22,794 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:22,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-03 14:13:22,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:13:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:13:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:23,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:23,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1805 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:13:23,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-03 14:13:23,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:23,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289141690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:23,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:23,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-03-03 14:13:23,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474943014] [2025-03-03 14:13:23,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:23,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:13:23,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:23,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:13:23,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:23,068 INFO L87 Difference]: Start difference. First operand 4056 states and 6836 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:13:23,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:23,150 INFO L93 Difference]: Finished difference Result 4073 states and 6856 transitions. [2025-03-03 14:13:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2025-03-03 14:13:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:23,171 INFO L225 Difference]: With dead ends: 4073 [2025-03-03 14:13:23,172 INFO L226 Difference]: Without dead ends: 4056 [2025-03-03 14:13:23,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:23,177 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 0 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3392 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:23,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3392 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2025-03-03 14:13:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 4056. [2025-03-03 14:13:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 3140 states have (on average 1.6496815286624205) internal successors, (5180), 3287 states have internal predecessors, (5180), 749 states have call successors, (749), 136 states have call predecessors, (749), 166 states have return successors, (895), 754 states have call predecessors, (895), 744 states have call successors, (895) [2025-03-03 14:13:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 6824 transitions. [2025-03-03 14:13:23,271 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 6824 transitions. Word has length 127 [2025-03-03 14:13:23,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:23,271 INFO L471 AbstractCegarLoop]: Abstraction has 4056 states and 6824 transitions. [2025-03-03 14:13:23,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-03 14:13:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 6824 transitions. [2025-03-03 14:13:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:13:23,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:23,278 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:23,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-03 14:13:23,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-03 14:13:23,479 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:23,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:23,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1346975342, now seen corresponding path program 1 times [2025-03-03 14:13:23,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:23,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506342665] [2025-03-03 14:13:23,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:23,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:23,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:13:23,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:13:23,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:23,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:23,610 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:13:23,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:23,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506342665] [2025-03-03 14:13:23,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506342665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144184670] [2025-03-03 14:13:23,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:23,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:23,613 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:23,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-03 14:13:23,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:13:23,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:13:23,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:23,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:23,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1841 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 14:13:23,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:23,906 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:13:23,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144184670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:23,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 7 [2025-03-03 14:13:23,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363896159] [2025-03-03 14:13:23,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:23,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:23,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:23,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:23,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:23,909 INFO L87 Difference]: Start difference. First operand 4056 states and 6824 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:13:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:24,084 INFO L93 Difference]: Finished difference Result 7967 states and 13441 transitions. [2025-03-03 14:13:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:13:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 137 [2025-03-03 14:13:24,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:24,111 INFO L225 Difference]: With dead ends: 7967 [2025-03-03 14:13:24,111 INFO L226 Difference]: Without dead ends: 4136 [2025-03-03 14:13:24,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:13:24,126 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 119 mSDsluCounter, 4098 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 4938 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:24,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 4938 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4136 states. [2025-03-03 14:13:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4136 to 4056. [2025-03-03 14:13:24,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4056 states, 3140 states have (on average 1.6496815286624205) internal successors, (5180), 3287 states have internal predecessors, (5180), 749 states have call successors, (749), 136 states have call predecessors, (749), 166 states have return successors, (895), 754 states have call predecessors, (895), 744 states have call successors, (895) [2025-03-03 14:13:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4056 states to 4056 states and 6824 transitions. [2025-03-03 14:13:24,264 INFO L78 Accepts]: Start accepts. Automaton has 4056 states and 6824 transitions. Word has length 137 [2025-03-03 14:13:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:24,265 INFO L471 AbstractCegarLoop]: Abstraction has 4056 states and 6824 transitions. [2025-03-03 14:13:24,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:13:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 4056 states and 6824 transitions. [2025-03-03 14:13:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 14:13:24,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:24,271 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:24,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:24,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-03 14:13:24,477 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:24,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:24,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1449895291, now seen corresponding path program 1 times [2025-03-03 14:13:24,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:24,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601359688] [2025-03-03 14:13:24,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:24,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:24,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:13:24,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:13:24,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:24,536 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 14:13:24,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601359688] [2025-03-03 14:13:24,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601359688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:24,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173322871] [2025-03-03 14:13:24,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:24,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:24,538 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:24,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-03 14:13:24,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 14:13:24,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 14:13:24,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:24,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:24,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 1842 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 14:13:24,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:24,815 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 14:13:24,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:24,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173322871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:24,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:24,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2025-03-03 14:13:24,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684782197] [2025-03-03 14:13:24,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:24,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:24,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:24,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:24,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:13:24,817 INFO L87 Difference]: Start difference. First operand 4056 states and 6824 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:13:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:24,927 INFO L93 Difference]: Finished difference Result 7974 states and 13450 transitions. [2025-03-03 14:13:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2025-03-03 14:13:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:24,951 INFO L225 Difference]: With dead ends: 7974 [2025-03-03 14:13:24,952 INFO L226 Difference]: Without dead ends: 3886 [2025-03-03 14:13:24,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:24,965 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 7 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:24,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2522 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2025-03-03 14:13:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3886. [2025-03-03 14:13:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 2985 states have (on average 1.654606365159129) internal successors, (4939), 3126 states have internal predecessors, (4939), 744 states have call successors, (744), 133 states have call predecessors, (744), 156 states have return successors, (881), 748 states have call predecessors, (881), 739 states have call successors, (881) [2025-03-03 14:13:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 6564 transitions. [2025-03-03 14:13:25,107 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 6564 transitions. Word has length 137 [2025-03-03 14:13:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:25,108 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 6564 transitions. [2025-03-03 14:13:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:13:25,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 6564 transitions. [2025-03-03 14:13:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:13:25,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:25,115 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:25,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:25,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-03 14:13:25,317 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:25,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:25,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1874819450, now seen corresponding path program 1 times [2025-03-03 14:13:25,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:25,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58378271] [2025-03-03 14:13:25,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:25,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:25,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:13:25,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:13:25,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:25,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:13:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58378271] [2025-03-03 14:13:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58378271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188112523] [2025-03-03 14:13:25,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:25,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:25,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:25,407 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:25,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-03 14:13:25,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:13:25,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:13:25,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:25,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:25,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 1847 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:25,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:13:25,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:25,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188112523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:25,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 14:13:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149777655] [2025-03-03 14:13:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:13:25,670 INFO L87 Difference]: Start difference. First operand 3886 states and 6564 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:13:25,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:25,804 INFO L93 Difference]: Finished difference Result 7774 states and 13141 transitions. [2025-03-03 14:13:25,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:25,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2025-03-03 14:13:25,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:25,829 INFO L225 Difference]: With dead ends: 7774 [2025-03-03 14:13:25,829 INFO L226 Difference]: Without dead ends: 3919 [2025-03-03 14:13:25,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:25,842 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 128 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:25,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2401 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:25,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-03 14:13:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3886. [2025-03-03 14:13:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 2985 states have (on average 1.6542713567839196) internal successors, (4938), 3126 states have internal predecessors, (4938), 744 states have call successors, (744), 133 states have call predecessors, (744), 156 states have return successors, (881), 748 states have call predecessors, (881), 739 states have call successors, (881) [2025-03-03 14:13:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 6563 transitions. [2025-03-03 14:13:26,040 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 6563 transitions. Word has length 139 [2025-03-03 14:13:26,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:26,041 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 6563 transitions. [2025-03-03 14:13:26,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:13:26,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 6563 transitions. [2025-03-03 14:13:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:13:26,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:26,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:26,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2025-03-03 14:13:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 14:13:26,246 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:26,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1618458573, now seen corresponding path program 1 times [2025-03-03 14:13:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806785170] [2025-03-03 14:13:26,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:26,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:26,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:13:26,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:13:26,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:26,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:13:26,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806785170] [2025-03-03 14:13:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806785170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:26,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:13:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24399023] [2025-03-03 14:13:26,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:26,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:26,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:26,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:26,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:26,352 INFO L87 Difference]: Start difference. First operand 3886 states and 6563 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:13:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:26,458 INFO L93 Difference]: Finished difference Result 5543 states and 9348 transitions. [2025-03-03 14:13:26,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:13:26,459 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 140 [2025-03-03 14:13:26,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:26,478 INFO L225 Difference]: With dead ends: 5543 [2025-03-03 14:13:26,478 INFO L226 Difference]: Without dead ends: 3921 [2025-03-03 14:13:26,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:13:26,486 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 115 mSDsluCounter, 4093 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 4932 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:26,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 4932 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:26,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2025-03-03 14:13:26,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 3886. [2025-03-03 14:13:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 2985 states have (on average 1.6542713567839196) internal successors, (4938), 3126 states have internal predecessors, (4938), 744 states have call successors, (744), 133 states have call predecessors, (744), 156 states have return successors, (881), 748 states have call predecessors, (881), 739 states have call successors, (881) [2025-03-03 14:13:26,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 6563 transitions. [2025-03-03 14:13:26,584 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 6563 transitions. Word has length 140 [2025-03-03 14:13:26,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:26,584 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 6563 transitions. [2025-03-03 14:13:26,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:13:26,585 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 6563 transitions. [2025-03-03 14:13:26,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:13:26,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:26,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:26,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:13:26,590 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:26,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:26,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1318291997, now seen corresponding path program 1 times [2025-03-03 14:13:26,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:26,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515718866] [2025-03-03 14:13:26,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:26,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:13:26,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:13:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:13:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:26,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515718866] [2025-03-03 14:13:26,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515718866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:26,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:26,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:13:26,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276181555] [2025-03-03 14:13:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:26,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:26,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:26,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:13:26,689 INFO L87 Difference]: Start difference. First operand 3886 states and 6563 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:13:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:26,751 INFO L93 Difference]: Finished difference Result 5592 states and 9430 transitions. [2025-03-03 14:13:26,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2025-03-03 14:13:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:26,760 INFO L225 Difference]: With dead ends: 5592 [2025-03-03 14:13:26,761 INFO L226 Difference]: Without dead ends: 1721 [2025-03-03 14:13:26,770 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-03-03 14:13:26,771 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 8 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:26,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2519 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1721 states. [2025-03-03 14:13:26,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1721 to 1721. [2025-03-03 14:13:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1355 states have (on average 1.6605166051660516) internal successors, (2250), 1414 states have internal predecessors, (2250), 295 states have call successors, (295), 70 states have call predecessors, (295), 70 states have return successors, (312), 287 states have call predecessors, (312), 290 states have call successors, (312) [2025-03-03 14:13:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2857 transitions. [2025-03-03 14:13:26,814 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2857 transitions. Word has length 140 [2025-03-03 14:13:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:26,815 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2857 transitions. [2025-03-03 14:13:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:13:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2857 transitions. [2025-03-03 14:13:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:13:26,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:26,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 14:13:26,817 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash -2104850782, now seen corresponding path program 1 times [2025-03-03 14:13:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785986542] [2025-03-03 14:13:26,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:26,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:13:26,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:13:26,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:26,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:13:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785986542] [2025-03-03 14:13:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785986542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:13:26,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620058563] [2025-03-03 14:13:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:26,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:26,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:26,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:26,938 INFO L87 Difference]: Start difference. First operand 1721 states and 2857 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:13:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:28,548 INFO L93 Difference]: Finished difference Result 3845 states and 6437 transitions. [2025-03-03 14:13:28,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:13:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 141 [2025-03-03 14:13:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:28,560 INFO L225 Difference]: With dead ends: 3845 [2025-03-03 14:13:28,560 INFO L226 Difference]: Without dead ends: 2228 [2025-03-03 14:13:28,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:13:28,566 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 2258 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:28,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 1912 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:13:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2025-03-03 14:13:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2083. [2025-03-03 14:13:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 1641 states have (on average 1.6575258988421695) internal successors, (2720), 1713 states have internal predecessors, (2720), 350 states have call successors, (350), 82 states have call predecessors, (350), 91 states have return successors, (392), 337 states have call predecessors, (392), 345 states have call successors, (392) [2025-03-03 14:13:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3462 transitions. [2025-03-03 14:13:28,648 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3462 transitions. Word has length 141 [2025-03-03 14:13:28,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:28,649 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3462 transitions. [2025-03-03 14:13:28,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:13:28,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3462 transitions. [2025-03-03 14:13:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:13:28,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:28,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:28,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 14:13:28,652 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:28,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1962970599, now seen corresponding path program 1 times [2025-03-03 14:13:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:28,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490338305] [2025-03-03 14:13:28,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:28,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:13:28,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:13:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:13:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490338305] [2025-03-03 14:13:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490338305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:28,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:28,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:13:28,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302928208] [2025-03-03 14:13:28,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:28,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:13:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:28,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:13:28,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:28,760 INFO L87 Difference]: Start difference. First operand 2083 states and 3462 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:13:28,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:28,828 INFO L93 Difference]: Finished difference Result 4087 states and 6851 transitions. [2025-03-03 14:13:28,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:28,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 146 [2025-03-03 14:13:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:28,839 INFO L225 Difference]: With dead ends: 4087 [2025-03-03 14:13:28,839 INFO L226 Difference]: Without dead ends: 2108 [2025-03-03 14:13:28,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:28,845 INFO L435 NwaCegarLoop]: 808 mSDtfsCounter, 0 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:28,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3202 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2025-03-03 14:13:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 2102. [2025-03-03 14:13:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 1656 states have (on average 1.6509661835748792) internal successors, (2734), 1727 states have internal predecessors, (2734), 349 states have call successors, (349), 82 states have call predecessors, (349), 96 states have return successors, (406), 342 states have call predecessors, (406), 344 states have call successors, (406) [2025-03-03 14:13:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 3489 transitions. [2025-03-03 14:13:28,901 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 3489 transitions. Word has length 146 [2025-03-03 14:13:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:28,901 INFO L471 AbstractCegarLoop]: Abstraction has 2102 states and 3489 transitions. [2025-03-03 14:13:28,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:13:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 3489 transitions. [2025-03-03 14:13:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:13:28,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:28,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:28,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 14:13:28,905 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:28,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1150961855, now seen corresponding path program 1 times [2025-03-03 14:13:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:28,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684361317] [2025-03-03 14:13:28,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:28,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:13:28,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:13:28,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:28,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:13:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:29,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684361317] [2025-03-03 14:13:29,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684361317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:29,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:29,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:13:29,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272700311] [2025-03-03 14:13:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:29,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:13:29,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:29,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:13:29,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:13:29,074 INFO L87 Difference]: Start difference. First operand 2102 states and 3489 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:13:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:30,619 INFO L93 Difference]: Finished difference Result 6766 states and 11426 transitions. [2025-03-03 14:13:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:13:30,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 150 [2025-03-03 14:13:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:30,636 INFO L225 Difference]: With dead ends: 6766 [2025-03-03 14:13:30,636 INFO L226 Difference]: Without dead ends: 4763 [2025-03-03 14:13:30,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:30,642 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2584 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 3250 mSolverCounterSat, 605 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 3855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 605 IncrementalHoareTripleChecker+Valid, 3250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:30,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 1871 Invalid, 3855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [605 Valid, 3250 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 14:13:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states. [2025-03-03 14:13:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4664. [2025-03-03 14:13:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4664 states, 3633 states have (on average 1.6501513900357831) internal successors, (5995), 3796 states have internal predecessors, (5995), 816 states have call successors, (816), 182 states have call predecessors, (816), 214 states have return successors, (1005), 807 states have call predecessors, (1005), 811 states have call successors, (1005) [2025-03-03 14:13:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 7816 transitions. [2025-03-03 14:13:30,764 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 7816 transitions. Word has length 150 [2025-03-03 14:13:30,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:30,766 INFO L471 AbstractCegarLoop]: Abstraction has 4664 states and 7816 transitions. [2025-03-03 14:13:30,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 7 states have call successors, (15), 4 states have call predecessors, (15), 3 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 14:13:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 7816 transitions. [2025-03-03 14:13:30,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:13:30,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:30,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:30,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 14:13:30,768 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:30,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1447917495, now seen corresponding path program 1 times [2025-03-03 14:13:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037687776] [2025-03-03 14:13:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:30,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:13:30,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:13:30,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:30,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:30,942 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:13:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037687776] [2025-03-03 14:13:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037687776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:30,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:30,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:13:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631903017] [2025-03-03 14:13:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:13:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:13:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:13:30,944 INFO L87 Difference]: Start difference. First operand 4664 states and 7816 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:13:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:31,223 INFO L93 Difference]: Finished difference Result 8944 states and 15337 transitions. [2025-03-03 14:13:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:13:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 153 [2025-03-03 14:13:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:31,244 INFO L225 Difference]: With dead ends: 8944 [2025-03-03 14:13:31,244 INFO L226 Difference]: Without dead ends: 4722 [2025-03-03 14:13:31,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:31,255 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 224 mSDsluCounter, 3145 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 3994 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:31,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 3994 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:13:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2025-03-03 14:13:31,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4668. [2025-03-03 14:13:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4668 states, 3635 states have (on average 1.6346629986244843) internal successors, (5942), 3800 states have internal predecessors, (5942), 816 states have call successors, (816), 182 states have call predecessors, (816), 216 states have return successors, (1009), 807 states have call predecessors, (1009), 811 states have call successors, (1009) [2025-03-03 14:13:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4668 states to 4668 states and 7767 transitions. [2025-03-03 14:13:31,399 INFO L78 Accepts]: Start accepts. Automaton has 4668 states and 7767 transitions. Word has length 153 [2025-03-03 14:13:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:31,399 INFO L471 AbstractCegarLoop]: Abstraction has 4668 states and 7767 transitions. [2025-03-03 14:13:31,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:13:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4668 states and 7767 transitions. [2025-03-03 14:13:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:13:31,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:31,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:31,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 14:13:31,402 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:31,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:31,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1770596140, now seen corresponding path program 1 times [2025-03-03 14:13:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:31,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862289439] [2025-03-03 14:13:31,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:31,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:31,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:13:31,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:13:31,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:31,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:31,509 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:13:31,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862289439] [2025-03-03 14:13:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862289439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102720296] [2025-03-03 14:13:31,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:31,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:31,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:31,513 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:31,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-03 14:13:31,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 14:13:31,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:13:31,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:31,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:31,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 1895 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:13:31,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:13:31,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:13:31,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102720296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:31,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:13:31,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 14:13:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481819771] [2025-03-03 14:13:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:31,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:31,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:31,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:31,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:13:31,832 INFO L87 Difference]: Start difference. First operand 4668 states and 7767 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:13:32,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:32,017 INFO L93 Difference]: Finished difference Result 9286 states and 15684 transitions. [2025-03-03 14:13:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:32,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 157 [2025-03-03 14:13:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:32,072 INFO L225 Difference]: With dead ends: 9286 [2025-03-03 14:13:32,077 INFO L226 Difference]: Without dead ends: 4718 [2025-03-03 14:13:32,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:13:32,102 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 14 mSDsluCounter, 1538 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:32,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2324 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2025-03-03 14:13:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4718. [2025-03-03 14:13:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4718 states, 3675 states have (on average 1.6247619047619049) internal successors, (5971), 3845 states have internal predecessors, (5971), 816 states have call successors, (816), 187 states have call predecessors, (816), 226 states have return successors, (1019), 807 states have call predecessors, (1019), 811 states have call successors, (1019) [2025-03-03 14:13:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4718 states to 4718 states and 7806 transitions. [2025-03-03 14:13:32,324 INFO L78 Accepts]: Start accepts. Automaton has 4718 states and 7806 transitions. Word has length 157 [2025-03-03 14:13:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:32,325 INFO L471 AbstractCegarLoop]: Abstraction has 4718 states and 7806 transitions. [2025-03-03 14:13:32,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:13:32,325 INFO L276 IsEmpty]: Start isEmpty. Operand 4718 states and 7806 transitions. [2025-03-03 14:13:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 14:13:32,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:32,327 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:32,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-03 14:13:32,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:32,528 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:32,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1922967139, now seen corresponding path program 1 times [2025-03-03 14:13:32,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:32,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701037318] [2025-03-03 14:13:32,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:32,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 14:13:32,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 14:13:32,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:32,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:32,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:13:32,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:32,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701037318] [2025-03-03 14:13:32,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701037318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:32,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:32,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:13:32,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987257431] [2025-03-03 14:13:32,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:32,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:32,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:32,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:32,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:32,663 INFO L87 Difference]: Start difference. First operand 4718 states and 7806 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:13:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:34,193 INFO L93 Difference]: Finished difference Result 9098 states and 15147 transitions. [2025-03-03 14:13:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:13:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 158 [2025-03-03 14:13:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:34,211 INFO L225 Difference]: With dead ends: 9098 [2025-03-03 14:13:34,211 INFO L226 Difference]: Without dead ends: 5242 [2025-03-03 14:13:34,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:13:34,219 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 1836 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 3523 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1910 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 3932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 3523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:34,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1910 Valid, 2127 Invalid, 3932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 3523 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:13:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2025-03-03 14:13:34,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 4867. [2025-03-03 14:13:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 3785 states have (on average 1.6150594451783356) internal successors, (6113), 3965 states have internal predecessors, (6113), 830 states have call successors, (830), 202 states have call predecessors, (830), 251 states have return successors, (1070), 821 states have call predecessors, (1070), 825 states have call successors, (1070) [2025-03-03 14:13:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 8013 transitions. [2025-03-03 14:13:34,373 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 8013 transitions. Word has length 158 [2025-03-03 14:13:34,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:34,373 INFO L471 AbstractCegarLoop]: Abstraction has 4867 states and 8013 transitions. [2025-03-03 14:13:34,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:13:34,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 8013 transitions. [2025-03-03 14:13:34,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:13:34,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:34,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:34,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 14:13:34,375 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:34,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:34,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1018366736, now seen corresponding path program 1 times [2025-03-03 14:13:34,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:34,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89827394] [2025-03-03 14:13:34,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:34,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:13:34,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:13:34,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:34,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:13:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89827394] [2025-03-03 14:13:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89827394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:34,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:34,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:13:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239317073] [2025-03-03 14:13:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:34,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:13:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:34,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:13:34,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:13:34,682 INFO L87 Difference]: Start difference. First operand 4867 states and 8013 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:13:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:35,757 INFO L93 Difference]: Finished difference Result 9646 states and 15987 transitions. [2025-03-03 14:13:35,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:13:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) Word has length 163 [2025-03-03 14:13:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:35,777 INFO L225 Difference]: With dead ends: 9646 [2025-03-03 14:13:35,777 INFO L226 Difference]: Without dead ends: 4893 [2025-03-03 14:13:35,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:13:35,787 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 1175 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:35,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1713 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 14:13:35,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2025-03-03 14:13:35,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4877. [2025-03-03 14:13:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4877 states, 3790 states have (on average 1.6063324538258574) internal successors, (6088), 3975 states have internal predecessors, (6088), 830 states have call successors, (830), 202 states have call predecessors, (830), 256 states have return successors, (1110), 821 states have call predecessors, (1110), 825 states have call successors, (1110) [2025-03-03 14:13:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 8028 transitions. [2025-03-03 14:13:35,969 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 8028 transitions. Word has length 163 [2025-03-03 14:13:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:35,969 INFO L471 AbstractCegarLoop]: Abstraction has 4877 states and 8028 transitions. [2025-03-03 14:13:35,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 7 states have internal predecessors, (113), 4 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:13:35,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 8028 transitions. [2025-03-03 14:13:35,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 14:13:35,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:35,972 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:35,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 14:13:35,972 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:35,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:35,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2004942213, now seen corresponding path program 1 times [2025-03-03 14:13:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716205925] [2025-03-03 14:13:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:35,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 14:13:35,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 14:13:35,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:35,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 14:13:36,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716205925] [2025-03-03 14:13:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716205925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:36,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:36,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:13:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329763552] [2025-03-03 14:13:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:36,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:13:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:36,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:13:36,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:36,073 INFO L87 Difference]: Start difference. First operand 4877 states and 8028 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:13:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:37,711 INFO L93 Difference]: Finished difference Result 16506 states and 27699 transitions. [2025-03-03 14:13:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:13:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 164 [2025-03-03 14:13:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:37,761 INFO L225 Difference]: With dead ends: 16506 [2025-03-03 14:13:37,762 INFO L226 Difference]: Without dead ends: 11749 [2025-03-03 14:13:37,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:37,780 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 1984 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:37,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2055 Valid, 1152 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:13:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11749 states. [2025-03-03 14:13:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11749 to 11340. [2025-03-03 14:13:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11340 states, 8677 states have (on average 1.5996312089431832) internal successors, (13880), 9136 states have internal predecessors, (13880), 2079 states have call successors, (2079), 432 states have call predecessors, (2079), 583 states have return successors, (3001), 2065 states have call predecessors, (3001), 2074 states have call successors, (3001) [2025-03-03 14:13:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11340 states to 11340 states and 18960 transitions. [2025-03-03 14:13:38,264 INFO L78 Accepts]: Start accepts. Automaton has 11340 states and 18960 transitions. Word has length 164 [2025-03-03 14:13:38,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:38,264 INFO L471 AbstractCegarLoop]: Abstraction has 11340 states and 18960 transitions. [2025-03-03 14:13:38,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 4 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:13:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11340 states and 18960 transitions. [2025-03-03 14:13:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 14:13:38,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:38,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:38,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 14:13:38,268 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:38,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1959698053, now seen corresponding path program 1 times [2025-03-03 14:13:38,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:38,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56505780] [2025-03-03 14:13:38,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:38,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 14:13:38,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 14:13:38,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:38,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:13:38,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:38,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56505780] [2025-03-03 14:13:38,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56505780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:38,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:13:38,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417821788] [2025-03-03 14:13:38,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:38,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:13:38,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:38,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:13:38,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:13:38,425 INFO L87 Difference]: Start difference. First operand 11340 states and 18960 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 5 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 14:13:41,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:41,196 INFO L93 Difference]: Finished difference Result 24224 states and 40440 transitions. [2025-03-03 14:13:41,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:13:41,197 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 5 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) Word has length 174 [2025-03-03 14:13:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:41,263 INFO L225 Difference]: With dead ends: 24224 [2025-03-03 14:13:41,263 INFO L226 Difference]: Without dead ends: 14416 [2025-03-03 14:13:41,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:13:41,304 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 1948 mSDsluCounter, 3064 mSDsCounter, 0 mSdLazyCounter, 6670 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 3611 SdHoareTripleChecker+Invalid, 7087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 6670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:41,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 3611 Invalid, 7087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 6670 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:13:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14416 states. [2025-03-03 14:13:41,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14416 to 13341. [2025-03-03 14:13:41,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13341 states, 10264 states have (on average 1.578526890101325) internal successors, (16202), 10796 states have internal predecessors, (16202), 2320 states have call successors, (2320), 548 states have call predecessors, (2320), 756 states have return successors, (3397), 2290 states have call predecessors, (3397), 2315 states have call successors, (3397) [2025-03-03 14:13:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13341 states to 13341 states and 21919 transitions. [2025-03-03 14:13:41,890 INFO L78 Accepts]: Start accepts. Automaton has 13341 states and 21919 transitions. Word has length 174 [2025-03-03 14:13:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 13341 states and 21919 transitions. [2025-03-03 14:13:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 5 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (18), 5 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-03 14:13:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 13341 states and 21919 transitions. [2025-03-03 14:13:41,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-03 14:13:41,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:41,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:41,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 14:13:41,894 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:41,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:41,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2088956156, now seen corresponding path program 1 times [2025-03-03 14:13:41,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:41,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749557717] [2025-03-03 14:13:41,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:41,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:41,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-03 14:13:41,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-03 14:13:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:42,037 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:13:42,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:42,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749557717] [2025-03-03 14:13:42,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749557717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:42,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:42,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:13:42,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958970361] [2025-03-03 14:13:42,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:42,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:13:42,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:42,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:13:42,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:13:42,039 INFO L87 Difference]: Start difference. First operand 13341 states and 21919 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:13:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:43,873 INFO L93 Difference]: Finished difference Result 40315 states and 67029 transitions. [2025-03-03 14:13:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:13:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 174 [2025-03-03 14:13:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:43,989 INFO L225 Difference]: With dead ends: 40315 [2025-03-03 14:13:43,990 INFO L226 Difference]: Without dead ends: 27078 [2025-03-03 14:13:44,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:13:44,042 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 1747 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:44,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 608 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:13:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27078 states. [2025-03-03 14:13:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27078 to 27076. [2025-03-03 14:13:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27076 states, 20843 states have (on average 1.567432711221993) internal successors, (32670), 21967 states have internal predecessors, (32670), 4650 states have call successors, (4650), 1092 states have call predecessors, (4650), 1582 states have return successors, (7431), 4604 states have call predecessors, (7431), 4645 states have call successors, (7431) [2025-03-03 14:13:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27076 states to 27076 states and 44751 transitions. [2025-03-03 14:13:45,380 INFO L78 Accepts]: Start accepts. Automaton has 27076 states and 44751 transitions. Word has length 174 [2025-03-03 14:13:45,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:45,380 INFO L471 AbstractCegarLoop]: Abstraction has 27076 states and 44751 transitions. [2025-03-03 14:13:45,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 4 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:13:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 27076 states and 44751 transitions. [2025-03-03 14:13:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 14:13:45,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:45,387 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:45,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 14:13:45,387 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:45,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash 332963592, now seen corresponding path program 1 times [2025-03-03 14:13:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003688705] [2025-03-03 14:13:45,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:45,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:45,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-03 14:13:45,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-03 14:13:45,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:45,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:13:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003688705] [2025-03-03 14:13:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003688705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:13:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:13:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:13:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7305430] [2025-03-03 14:13:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:13:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:13:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:45,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:13:45,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:45,596 INFO L87 Difference]: Start difference. First operand 27076 states and 44751 transitions. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 14:13:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:13:46,604 INFO L93 Difference]: Finished difference Result 27187 states and 44896 transitions. [2025-03-03 14:13:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:13:46,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 175 [2025-03-03 14:13:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:13:46,707 INFO L225 Difference]: With dead ends: 27187 [2025-03-03 14:13:46,707 INFO L226 Difference]: Without dead ends: 27166 [2025-03-03 14:13:46,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:13:46,722 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 0 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4748 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:13:46,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4748 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:13:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27166 states. [2025-03-03 14:13:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27166 to 27166. [2025-03-03 14:13:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27166 states, 20933 states have (on average 1.5635599292982372) internal successors, (32730), 22057 states have internal predecessors, (32730), 4650 states have call successors, (4650), 1092 states have call predecessors, (4650), 1582 states have return successors, (7431), 4604 states have call predecessors, (7431), 4645 states have call successors, (7431) [2025-03-03 14:13:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27166 states to 27166 states and 44811 transitions. [2025-03-03 14:13:48,154 INFO L78 Accepts]: Start accepts. Automaton has 27166 states and 44811 transitions. Word has length 175 [2025-03-03 14:13:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:13:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 27166 states and 44811 transitions. [2025-03-03 14:13:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-03 14:13:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27166 states and 44811 transitions. [2025-03-03 14:13:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 14:13:48,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:13:48,168 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:13:48,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 14:13:48,168 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:13:48,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:13:48,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1006574263, now seen corresponding path program 1 times [2025-03-03 14:13:48,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:13:48,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757165060] [2025-03-03 14:13:48,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:48,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:13:48,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 14:13:48,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 14:13:48,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:48,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:48,530 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 14:13:48,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:13:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757165060] [2025-03-03 14:13:48,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757165060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:13:48,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565596174] [2025-03-03 14:13:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:13:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:13:48,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:13:48,532 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:13:48,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-03 14:13:48,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 14:13:48,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 14:13:48,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:13:48,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:13:48,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 2036 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:13:48,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:13:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 46 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:13:49,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:13:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 14:13:49,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565596174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:13:49,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:13:49,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 23 [2025-03-03 14:13:49,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40230189] [2025-03-03 14:13:49,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:13:49,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 14:13:49,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:13:49,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 14:13:49,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:13:49,537 INFO L87 Difference]: Start difference. First operand 27166 states and 44811 transitions. Second operand has 23 states, 22 states have (on average 13.181818181818182) internal successors, (290), 19 states have internal predecessors, (290), 10 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (55), 14 states have call predecessors, (55), 9 states have call successors, (55) [2025-03-03 14:14:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:14:00,582 INFO L93 Difference]: Finished difference Result 133156 states and 225905 transitions. [2025-03-03 14:14:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 14:14:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 13.181818181818182) internal successors, (290), 19 states have internal predecessors, (290), 10 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (55), 14 states have call predecessors, (55), 9 states have call successors, (55) Word has length 203 [2025-03-03 14:14:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:14:01,230 INFO L225 Difference]: With dead ends: 133156 [2025-03-03 14:14:01,230 INFO L226 Difference]: Without dead ends: 106233 [2025-03-03 14:14:01,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 406 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=2085, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 14:14:01,362 INFO L435 NwaCegarLoop]: 1510 mSDtfsCounter, 5683 mSDsluCounter, 12889 mSDsCounter, 0 mSdLazyCounter, 19495 mSolverCounterSat, 1626 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5752 SdHoareTripleChecker+Valid, 14399 SdHoareTripleChecker+Invalid, 21121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1626 IncrementalHoareTripleChecker+Valid, 19495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:14:01,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5752 Valid, 14399 Invalid, 21121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1626 Valid, 19495 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-03-03 14:14:01,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106233 states. [2025-03-03 14:14:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106233 to 104854. [2025-03-03 14:14:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104854 states, 79356 states have (on average 1.5559251978426332) internal successors, (123472), 83879 states have internal predecessors, (123472), 19614 states have call successors, (19614), 3796 states have call predecessors, (19614), 5883 states have return successors, (34907), 19686 states have call predecessors, (34907), 19609 states have call successors, (34907) [2025-03-03 14:14:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104854 states to 104854 states and 177993 transitions. [2025-03-03 14:14:07,830 INFO L78 Accepts]: Start accepts. Automaton has 104854 states and 177993 transitions. Word has length 203 [2025-03-03 14:14:07,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:14:07,830 INFO L471 AbstractCegarLoop]: Abstraction has 104854 states and 177993 transitions. [2025-03-03 14:14:07,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 13.181818181818182) internal successors, (290), 19 states have internal predecessors, (290), 10 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (55), 14 states have call predecessors, (55), 9 states have call successors, (55) [2025-03-03 14:14:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 104854 states and 177993 transitions. [2025-03-03 14:14:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 14:14:07,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:14:07,863 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:14:07,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-03 14:14:08,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-03 14:14:08,064 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:14:08,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:14:08,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1065126158, now seen corresponding path program 1 times [2025-03-03 14:14:08,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:14:08,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910244442] [2025-03-03 14:14:08,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:14:08,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:14:08,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:14:08,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:14:08,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:14:08,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:14:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 14:14:08,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:14:08,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910244442] [2025-03-03 14:14:08,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910244442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:14:08,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580391027] [2025-03-03 14:14:08,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:14:08,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:14:08,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:14:08,271 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:14:08,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-03 14:14:08,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:14:08,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:14:08,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:14:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:14:08,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 2033 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 14:14:08,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:14:08,579 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-03 14:14:08,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:14:08,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580391027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:14:08,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:14:08,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-03 14:14:08,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289749575] [2025-03-03 14:14:08,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:14:08,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:14:08,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:14:08,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:14:08,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:14:08,581 INFO L87 Difference]: Start difference. First operand 104854 states and 177993 transitions. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:14:13,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:14:13,276 INFO L93 Difference]: Finished difference Result 147216 states and 248744 transitions. [2025-03-03 14:14:13,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:14:13,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 204 [2025-03-03 14:14:13,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:14:13,683 INFO L225 Difference]: With dead ends: 147216 [2025-03-03 14:14:13,684 INFO L226 Difference]: Without dead ends: 58769 [2025-03-03 14:14:14,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:14:14,049 INFO L435 NwaCegarLoop]: 780 mSDtfsCounter, 15 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2317 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:14:14,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2317 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:14:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58769 states. [2025-03-03 14:14:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58769 to 58769. [2025-03-03 14:14:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58769 states, 44392 states have (on average 1.5603937646422779) internal successors, (69269), 46902 states have internal predecessors, (69269), 11137 states have call successors, (11137), 2172 states have call predecessors, (11137), 3239 states have return successors, (18147), 11170 states have call predecessors, (18147), 11133 states have call successors, (18147) [2025-03-03 14:14:17,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58769 states to 58769 states and 98553 transitions. [2025-03-03 14:14:17,137 INFO L78 Accepts]: Start accepts. Automaton has 58769 states and 98553 transitions. Word has length 204 [2025-03-03 14:14:17,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:14:17,137 INFO L471 AbstractCegarLoop]: Abstraction has 58769 states and 98553 transitions. [2025-03-03 14:14:17,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:14:17,138 INFO L276 IsEmpty]: Start isEmpty. Operand 58769 states and 98553 transitions. [2025-03-03 14:14:17,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-03 14:14:17,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:14:17,155 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:14:17,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-03 14:14:17,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:14:17,356 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:14:17,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:14:17,356 INFO L85 PathProgramCache]: Analyzing trace with hash -391427467, now seen corresponding path program 1 times [2025-03-03 14:14:17,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:14:17,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232998417] [2025-03-03 14:14:17,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:14:17,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:14:17,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:14:17,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:14:17,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:14:17,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:14:17,428 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 14:14:17,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:14:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232998417] [2025-03-03 14:14:17,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232998417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:14:17,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795370958] [2025-03-03 14:14:17,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:14:17,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:14:17,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:14:17,431 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:14:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-03 14:14:17,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-03 14:14:17,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-03 14:14:17,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:14:17,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:14:17,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 2037 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:14:17,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:14:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 14:14:17,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:14:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795370958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:14:17,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:14:17,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 14:14:17,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284039914] [2025-03-03 14:14:17,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:14:17,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:14:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:14:17,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:14:17,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:14:17,723 INFO L87 Difference]: Start difference. First operand 58769 states and 98553 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-03 14:14:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:14:20,879 INFO L93 Difference]: Finished difference Result 118859 states and 200562 transitions. [2025-03-03 14:14:20,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:14:20,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 204 [2025-03-03 14:14:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:14:21,270 INFO L225 Difference]: With dead ends: 118859 [2025-03-03 14:14:21,270 INFO L226 Difference]: Without dead ends: 60259 [2025-03-03 14:14:21,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:14:21,513 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 10 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:14:21,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2281 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:14:21,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60259 states.