./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_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_spec3_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 2e63e44256bba8522bf99795cd1238c2e8ad8456659e8a545df838f8f88bd318 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:16:56,921 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:16:56,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:16:56,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:16:56,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:16:56,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:16:56,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:16:56,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:16:56,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:16:56,988 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:16:56,988 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:16:56,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:16:56,988 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:16:56,988 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:16:56,988 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:16:56,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:16:56,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:16:56,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:56,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:16:56,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:16:56,990 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 -> 2e63e44256bba8522bf99795cd1238c2e8ad8456659e8a545df838f8f88bd318 [2025-03-03 14:16:57,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:16:57,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:16:57,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:16:57,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:16:57,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:16:57,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product01.cil.c [2025-03-03 14:16:58,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9bdadbe/f22a48c99ef443629a172399ac851bf0/FLAG594000fdf [2025-03-03 14:16:58,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:16:58,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product01.cil.c [2025-03-03 14:16:58,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9bdadbe/f22a48c99ef443629a172399ac851bf0/FLAG594000fdf [2025-03-03 14:16:58,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de9bdadbe/f22a48c99ef443629a172399ac851bf0 [2025-03-03 14:16:58,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:16:58,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:16:58,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:58,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:16:58,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:16:58,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:58" (1/1) ... [2025-03-03 14:16:58,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14924845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:58, skipping insertion in model container [2025-03-03 14:16:58,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:58" (1/1) ... [2025-03-03 14:16:58,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:16:59,234 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_spec3_product01.cil.c[40412,40425] [2025-03-03 14:16:59,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:59,307 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:16:59,312 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:16:59,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [408] [2025-03-03 14:16:59,313 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [620] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [1287] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1477] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1843] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1878] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1893] [2025-03-03 14:16:59,314 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1902] [2025-03-03 14:16:59,352 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_spec3_product01.cil.c[40412,40425] [2025-03-03 14:16:59,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:59,417 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:16:59,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59 WrapperNode [2025-03-03 14:16:59,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:59,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:59,418 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:16:59,418 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:16:59,423 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:16:59" (1/1) ... [2025-03-03 14:16:59,437 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:16:59" (1/1) ... [2025-03-03 14:16:59,462 INFO L138 Inliner]: procedures = 86, calls = 334, calls flagged for inlining = 21, calls inlined = 18, statements flattened = 746 [2025-03-03 14:16:59,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:59,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:16:59,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:16:59,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:16:59,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,503 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:16:59,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:16:59,541 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:16:59,541 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:16:59,541 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:16:59,542 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (1/1) ... [2025-03-03 14:16:59,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:59,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:59,566 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:16:59,570 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:16:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:16:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:16:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:16:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:16:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:16:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:16:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:16:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:16:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:16:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:16:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:16:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:16:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:16:59,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:16:59,589 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:16:59,589 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:16:59,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:16:59,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:16:59,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:16:59,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:16:59,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:16:59,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:16:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:16:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:16:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:16:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:16:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:16:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:16:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:16:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:16:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:16:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:16:59,591 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:16:59,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:16:59,749 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:16:59,751 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:16:59,779 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2155: #res := ~retValue_acc~17; [2025-03-03 14:16:59,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: #res := ~retValue_acc~4; [2025-03-03 14:16:59,812 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1974: #res := ~retValue_acc~13; [2025-03-03 14:17:00,133 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2640: #res := ~retValue_acc~21; [2025-03-03 14:17:00,199 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2744: #res := ~retValue_acc~24; [2025-03-03 14:17:00,211 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L486: #res := ~retValue_acc~3; [2025-03-03 14:17:00,231 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2146: #res := ~retValue_acc~16; [2025-03-03 14:17:00,313 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2275-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:17:00,314 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2288-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:17:00,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2730-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~23#1; [2025-03-03 14:17:00,467 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2103-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; [2025-03-03 14:17:00,520 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L973: #res := ~retValue_acc~6; [2025-03-03 14:17:00,569 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L405-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-03 14:17:00,569 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1875-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-03 14:17:00,579 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: #res := ~retValue_acc~5; [2025-03-03 14:17:00,583 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1284: #res := ~retValue_acc~7; [2025-03-03 14:17:00,691 INFO L? ?]: Removed 417 outVars from TransFormulas that were not future-live. [2025-03-03 14:17:00,691 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:17:00,715 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:17:00,715 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:17:00,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:00 BoogieIcfgContainer [2025-03-03 14:17:00,717 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:17:00,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:17:00,719 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:17:00,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:17:00,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:16:58" (1/3) ... [2025-03-03 14:17:00,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dceb77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:00, skipping insertion in model container [2025-03-03 14:17:00,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:59" (2/3) ... [2025-03-03 14:17:00,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dceb77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:00, skipping insertion in model container [2025-03-03 14:17:00,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:00" (3/3) ... [2025-03-03 14:17:00,725 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product01.cil.c [2025-03-03 14:17:00,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:17:00,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product01.cil.c that has 24 procedures, 545 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:17:00,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:17:00,798 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;@426cc846, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:17:00,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:17:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 422 states have (on average 1.6919431279620853) internal successors, (714), 440 states have internal predecessors, (714), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:17:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:17:00,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:00,817 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:00,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:00,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:00,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1409330331, now seen corresponding path program 1 times [2025-03-03 14:17:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:00,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009956979] [2025-03-03 14:17:00,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:00,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:17:00,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:17:00,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:00,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009956979] [2025-03-03 14:17:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009956979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908436312] [2025-03-03 14:17:01,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:01,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:01,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:01,425 INFO L87 Difference]: Start difference. First operand has 545 states, 422 states have (on average 1.6919431279620853) internal successors, (714), 440 states have internal predecessors, (714), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:01,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:01,600 INFO L93 Difference]: Finished difference Result 1087 states and 1832 transitions. [2025-03-03 14:17:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 85 [2025-03-03 14:17:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:01,616 INFO L225 Difference]: With dead ends: 1087 [2025-03-03 14:17:01,618 INFO L226 Difference]: Without dead ends: 550 [2025-03-03 14:17:01,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:01,625 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 91 mSDsluCounter, 4389 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5284 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:01,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5284 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-03 14:17:01,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-03-03 14:17:01,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 425 states have (on average 1.6847058823529413) internal successors, (716), 443 states have internal predecessors, (716), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2025-03-03 14:17:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 913 transitions. [2025-03-03 14:17:01,723 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 913 transitions. Word has length 85 [2025-03-03 14:17:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:01,723 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 913 transitions. [2025-03-03 14:17:01,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 913 transitions. [2025-03-03 14:17:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:17:01,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:01,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:01,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:17:01,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:01,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -837274401, now seen corresponding path program 1 times [2025-03-03 14:17:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858832898] [2025-03-03 14:17:01,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:01,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:17:01,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:17:01,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:01,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:01,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858832898] [2025-03-03 14:17:01,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858832898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:01,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:01,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:01,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549042774] [2025-03-03 14:17:01,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:01,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:01,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:01,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:01,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:01,874 INFO L87 Difference]: Start difference. First operand 548 states and 913 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:01,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:01,931 INFO L93 Difference]: Finished difference Result 1078 states and 1807 transitions. [2025-03-03 14:17:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-03 14:17:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:01,948 INFO L225 Difference]: With dead ends: 1078 [2025-03-03 14:17:01,948 INFO L226 Difference]: Without dead ends: 524 [2025-03-03 14:17:01,950 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:17:01,952 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 14 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:01,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2644 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-03 14:17:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-03 14:17:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 404 states have (on average 1.6757425742574257) internal successors, (677), 420 states have internal predecessors, (677), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 870 transitions. [2025-03-03 14:17:01,979 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 870 transitions. Word has length 86 [2025-03-03 14:17:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:01,980 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 870 transitions. [2025-03-03 14:17:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 870 transitions. [2025-03-03 14:17:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:17:01,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:01,984 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:01,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:17:01,984 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:01,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1278202037, now seen corresponding path program 1 times [2025-03-03 14:17:01,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:01,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45220454] [2025-03-03 14:17:01,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:02,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:17:02,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:17:02,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:02,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45220454] [2025-03-03 14:17:02,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45220454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622709018] [2025-03-03 14:17:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:02,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:02,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:02,227 INFO L87 Difference]: Start difference. First operand 524 states and 870 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:02,312 INFO L93 Difference]: Finished difference Result 1041 states and 1739 transitions. [2025-03-03 14:17:02,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:02,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2025-03-03 14:17:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:02,317 INFO L225 Difference]: With dead ends: 1041 [2025-03-03 14:17:02,318 INFO L226 Difference]: Without dead ends: 518 [2025-03-03 14:17:02,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:02,323 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 77 mSDsluCounter, 4225 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:02,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5084 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-03 14:17:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2025-03-03 14:17:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 398 states have (on average 1.6683417085427135) internal successors, (664), 414 states have internal predecessors, (664), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 857 transitions. [2025-03-03 14:17:02,353 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 857 transitions. Word has length 86 [2025-03-03 14:17:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:02,353 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 857 transitions. [2025-03-03 14:17:02,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 857 transitions. [2025-03-03 14:17:02,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:17:02,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:02,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:02,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:17:02,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:02,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:02,359 INFO L85 PathProgramCache]: Analyzing trace with hash 443238911, now seen corresponding path program 1 times [2025-03-03 14:17:02,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:02,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131770959] [2025-03-03 14:17:02,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:02,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:02,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:17:02,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:17:02,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:02,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131770959] [2025-03-03 14:17:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131770959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:02,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806772608] [2025-03-03 14:17:02,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:02,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:02,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:02,565 INFO L87 Difference]: Start difference. First operand 518 states and 857 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:02,638 INFO L93 Difference]: Finished difference Result 1029 states and 1713 transitions. [2025-03-03 14:17:02,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:02,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-03 14:17:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:02,642 INFO L225 Difference]: With dead ends: 1029 [2025-03-03 14:17:02,643 INFO L226 Difference]: Without dead ends: 512 [2025-03-03 14:17:02,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:02,646 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 63 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5024 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:02,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5024 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-03 14:17:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-03-03 14:17:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 392 states have (on average 1.6607142857142858) internal successors, (651), 408 states have internal predecessors, (651), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 844 transitions. [2025-03-03 14:17:02,669 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 844 transitions. Word has length 87 [2025-03-03 14:17:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:02,669 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 844 transitions. [2025-03-03 14:17:02,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 844 transitions. [2025-03-03 14:17:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:17:02,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:02,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:02,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:17:02,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:02,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1555510819, now seen corresponding path program 1 times [2025-03-03 14:17:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:02,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874361453] [2025-03-03 14:17:02,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:02,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:02,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:17:02,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:17:02,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:02,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874361453] [2025-03-03 14:17:02,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874361453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:02,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:02,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142707229] [2025-03-03 14:17:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:02,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:02,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:02,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:02,796 INFO L87 Difference]: Start difference. First operand 512 states and 844 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:02,849 INFO L93 Difference]: Finished difference Result 1017 states and 1687 transitions. [2025-03-03 14:17:02,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:02,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 88 [2025-03-03 14:17:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:02,852 INFO L225 Difference]: With dead ends: 1017 [2025-03-03 14:17:02,852 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:17:02,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:02,855 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 49 mSDsluCounter, 4129 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:02,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4964 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:02,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:17:02,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-03 14:17:02,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.650259067357513) internal successors, (637), 402 states have internal predecessors, (637), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:02,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 830 transitions. [2025-03-03 14:17:02,870 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 830 transitions. Word has length 88 [2025-03-03 14:17:02,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:02,871 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 830 transitions. [2025-03-03 14:17:02,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:02,871 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 830 transitions. [2025-03-03 14:17:02,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:17:02,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:02,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:02,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:17:02,873 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:02,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:02,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1311606631, now seen corresponding path program 1 times [2025-03-03 14:17:02,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:02,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3488837] [2025-03-03 14:17:02,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:02,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:02,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:17:02,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:17:02,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:02,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:02,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:02,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3488837] [2025-03-03 14:17:02,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3488837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:02,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857569955] [2025-03-03 14:17:02,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:02,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:02,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:02,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:02,976 INFO L87 Difference]: Start difference. First operand 506 states and 830 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:03,014 INFO L93 Difference]: Finished difference Result 996 states and 1646 transitions. [2025-03-03 14:17:03,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:03,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 89 [2025-03-03 14:17:03,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:03,018 INFO L225 Difference]: With dead ends: 996 [2025-03-03 14:17:03,018 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:17:03,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,021 INFO L435 NwaCegarLoop]: 815 mSDtfsCounter, 15 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:03,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2430 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:17:03,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-03 14:17:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.6476683937823835) internal successors, (636), 402 states have internal predecessors, (636), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 829 transitions. [2025-03-03 14:17:03,037 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 829 transitions. Word has length 89 [2025-03-03 14:17:03,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:03,037 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 829 transitions. [2025-03-03 14:17:03,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 829 transitions. [2025-03-03 14:17:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:17:03,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:03,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:03,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:17:03,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:03,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:03,040 INFO L85 PathProgramCache]: Analyzing trace with hash -530764371, now seen corresponding path program 1 times [2025-03-03 14:17:03,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:03,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872828174] [2025-03-03 14:17:03,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:03,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:03,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:17:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:17:03,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:03,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872828174] [2025-03-03 14:17:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872828174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246672313] [2025-03-03 14:17:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:03,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:03,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:03,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:03,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,123 INFO L87 Difference]: Start difference. First operand 506 states and 829 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:03,160 INFO L93 Difference]: Finished difference Result 996 states and 1644 transitions. [2025-03-03 14:17:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2025-03-03 14:17:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:03,163 INFO L225 Difference]: With dead ends: 996 [2025-03-03 14:17:03,163 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:17:03,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,166 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 14 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:03,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2432 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:17:03,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-03 14:17:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.645077720207254) internal successors, (635), 402 states have internal predecessors, (635), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 828 transitions. [2025-03-03 14:17:03,181 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 828 transitions. Word has length 90 [2025-03-03 14:17:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:03,181 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 828 transitions. [2025-03-03 14:17:03,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 828 transitions. [2025-03-03 14:17:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:17:03,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:03,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:03,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:17:03,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:03,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:03,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1897728548, now seen corresponding path program 1 times [2025-03-03 14:17:03,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:03,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758570603] [2025-03-03 14:17:03,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:03,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:03,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:17:03,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:17:03,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:03,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:03,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:03,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758570603] [2025-03-03 14:17:03,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758570603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:03,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:03,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977950690] [2025-03-03 14:17:03,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:03,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:03,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:03,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,267 INFO L87 Difference]: Start difference. First operand 506 states and 828 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, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:03,302 INFO L93 Difference]: Finished difference Result 996 states and 1642 transitions. [2025-03-03 14:17:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:03,302 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, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 91 [2025-03-03 14:17:03,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:03,306 INFO L225 Difference]: With dead ends: 996 [2025-03-03 14:17:03,306 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:17:03,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,308 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 13 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:03,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2434 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:17:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-03 14:17:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.6424870466321244) internal successors, (634), 402 states have internal predecessors, (634), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 827 transitions. [2025-03-03 14:17:03,324 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 827 transitions. Word has length 91 [2025-03-03 14:17:03,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:03,325 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 827 transitions. [2025-03-03 14:17:03,325 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, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,325 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 827 transitions. [2025-03-03 14:17:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:17:03,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:03,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:03,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:17:03,327 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:03,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:03,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1127215536, now seen corresponding path program 1 times [2025-03-03 14:17:03,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279654774] [2025-03-03 14:17:03,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:03,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:17:03,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:17:03,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:03,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:03,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:03,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279654774] [2025-03-03 14:17:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279654774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:03,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:03,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323050522] [2025-03-03 14:17:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:03,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:03,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:03,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:03,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,422 INFO L87 Difference]: Start difference. First operand 506 states and 827 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:03,453 INFO L93 Difference]: Finished difference Result 996 states and 1640 transitions. [2025-03-03 14:17:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-03-03 14:17:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:03,456 INFO L225 Difference]: With dead ends: 996 [2025-03-03 14:17:03,456 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 14:17:03,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:03,459 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 12 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:03,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2436 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 14:17:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2025-03-03 14:17:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 386 states have (on average 1.6398963730569949) internal successors, (633), 402 states have internal predecessors, (633), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-03 14:17:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 826 transitions. [2025-03-03 14:17:03,473 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 826 transitions. Word has length 92 [2025-03-03 14:17:03,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:03,473 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 826 transitions. [2025-03-03 14:17:03,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:17:03,473 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 826 transitions. [2025-03-03 14:17:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:17:03,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:03,475 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:03,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:17:03,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:03,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:03,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1480580895, now seen corresponding path program 1 times [2025-03-03 14:17:03,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:03,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413141781] [2025-03-03 14:17:03,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:03,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:03,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:17:03,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:17:03,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:03,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:03,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:03,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413141781] [2025-03-03 14:17:03,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413141781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:03,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401882735] [2025-03-03 14:17:03,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:03,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:03,655 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:17:03,657 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:17:03,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:17:03,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:17:03,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:03,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:03,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:03,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:04,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401882735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122979519] [2025-03-03 14:17:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:04,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:04,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:04,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:04,025 INFO L87 Difference]: Start difference. First operand 506 states and 826 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:04,083 INFO L93 Difference]: Finished difference Result 1430 states and 2368 transitions. [2025-03-03 14:17:04,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-03-03 14:17:04,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:04,089 INFO L225 Difference]: With dead ends: 1430 [2025-03-03 14:17:04,089 INFO L226 Difference]: Without dead ends: 942 [2025-03-03 14:17:04,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:04,093 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 770 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:04,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1556 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-03-03 14:17:04,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 927. [2025-03-03 14:17:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 714 states have (on average 1.6554621848739495) internal successors, (1182), 745 states have internal predecessors, (1182), 172 states have call successors, (172), 41 states have call predecessors, (172), 40 states have return successors, (174), 166 states have call predecessors, (174), 169 states have call successors, (174) [2025-03-03 14:17:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1528 transitions. [2025-03-03 14:17:04,131 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1528 transitions. Word has length 93 [2025-03-03 14:17:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:04,131 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1528 transitions. [2025-03-03 14:17:04,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1528 transitions. [2025-03-03 14:17:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:17:04,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:04,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:04,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:17:04,334 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,SelfDestructingSolverStorable9 [2025-03-03 14:17:04,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:04,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1771176987, now seen corresponding path program 1 times [2025-03-03 14:17:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836436806] [2025-03-03 14:17:04,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:04,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:17:04,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:17:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836436806] [2025-03-03 14:17:04,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836436806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:04,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442379140] [2025-03-03 14:17:04,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:04,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:04,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:04,536 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:17:04,538 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:17:04,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:17:04,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:17:04,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:04,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:04,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1547 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:04,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:04,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:04,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442379140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244261508] [2025-03-03 14:17:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:04,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:04,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:04,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:04,869 INFO L87 Difference]: Start difference. First operand 927 states and 1528 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:04,929 INFO L93 Difference]: Finished difference Result 2272 states and 3774 transitions. [2025-03-03 14:17:04,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:04,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2025-03-03 14:17:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:04,937 INFO L225 Difference]: With dead ends: 2272 [2025-03-03 14:17:04,937 INFO L226 Difference]: Without dead ends: 1363 [2025-03-03 14:17:04,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:04,942 INFO L435 NwaCegarLoop]: 886 mSDtfsCounter, 770 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:04,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1607 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:04,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-03-03 14:17:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1315. [2025-03-03 14:17:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1015 states have (on average 1.6699507389162562) internal successors, (1695), 1061 states have internal predecessors, (1695), 243 states have call successors, (243), 56 states have call predecessors, (243), 56 states have return successors, (250), 236 states have call predecessors, (250), 240 states have call successors, (250) [2025-03-03 14:17:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 2188 transitions. [2025-03-03 14:17:04,986 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 2188 transitions. Word has length 94 [2025-03-03 14:17:04,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:04,987 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 2188 transitions. [2025-03-03 14:17:04,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:17:04,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 2188 transitions. [2025-03-03 14:17:04,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:17:04,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:04,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:04,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:05,191 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,SelfDestructingSolverStorable10 [2025-03-03 14:17:05,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:05,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:05,191 INFO L85 PathProgramCache]: Analyzing trace with hash 261261279, now seen corresponding path program 1 times [2025-03-03 14:17:05,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:05,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762843660] [2025-03-03 14:17:05,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:05,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:05,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 14:17:05,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:17:05,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:05,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:05,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762843660] [2025-03-03 14:17:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762843660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:05,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139528559] [2025-03-03 14:17:05,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:05,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:05,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:05,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:05,301 INFO L87 Difference]: Start difference. First operand 1315 states and 2188 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:17:05,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:05,738 INFO L93 Difference]: Finished difference Result 3881 states and 6565 transitions. [2025-03-03 14:17:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-03 14:17:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:05,755 INFO L225 Difference]: With dead ends: 3881 [2025-03-03 14:17:05,756 INFO L226 Difference]: Without dead ends: 2584 [2025-03-03 14:17:05,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:05,788 INFO L435 NwaCegarLoop]: 925 mSDtfsCounter, 816 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:05,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 4257 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2025-03-03 14:17:05,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2537. [2025-03-03 14:17:05,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2537 states, 1963 states have (on average 1.6744778400407538) internal successors, (3287), 2051 states have internal predecessors, (3287), 465 states have call successors, (465), 106 states have call predecessors, (465), 108 states have return successors, (541), 457 states have call predecessors, (541), 461 states have call successors, (541) [2025-03-03 14:17:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2537 states to 2537 states and 4293 transitions. [2025-03-03 14:17:05,888 INFO L78 Accepts]: Start accepts. Automaton has 2537 states and 4293 transitions. Word has length 96 [2025-03-03 14:17:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:05,888 INFO L471 AbstractCegarLoop]: Abstraction has 2537 states and 4293 transitions. [2025-03-03 14:17:05,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:17:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2537 states and 4293 transitions. [2025-03-03 14:17:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:17:05,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:05,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:05,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:17:05,892 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:05,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1237195154, now seen corresponding path program 1 times [2025-03-03 14:17:05,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:05,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526302077] [2025-03-03 14:17:05,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:05,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:17:05,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:17:05,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:05,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526302077] [2025-03-03 14:17:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526302077] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606976912] [2025-03-03 14:17:06,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:06,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:06,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:06,068 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:17:06,069 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:17:06,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:17:06,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:17:06,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:06,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:06,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:17:06,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:06,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:06,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606976912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:06,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:06,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728184777] [2025-03-03 14:17:06,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:06,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:06,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:06,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:06,460 INFO L87 Difference]: Start difference. First operand 2537 states and 4293 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:17:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:06,698 INFO L93 Difference]: Finished difference Result 7321 states and 12584 transitions. [2025-03-03 14:17:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:06,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-03 14:17:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:06,726 INFO L225 Difference]: With dead ends: 7321 [2025-03-03 14:17:06,727 INFO L226 Difference]: Without dead ends: 4803 [2025-03-03 14:17:06,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:06,745 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 677 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 1589 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:06,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 1589 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4803 states. [2025-03-03 14:17:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4803 to 4766. [2025-03-03 14:17:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4766 states, 3676 states have (on average 1.6409140369967357) internal successors, (6032), 3850 states have internal predecessors, (6032), 878 states have call successors, (878), 206 states have call predecessors, (878), 211 states have return successors, (1127), 865 states have call predecessors, (1127), 872 states have call successors, (1127) [2025-03-03 14:17:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4766 states to 4766 states and 8037 transitions. [2025-03-03 14:17:06,972 INFO L78 Accepts]: Start accepts. Automaton has 4766 states and 8037 transitions. Word has length 97 [2025-03-03 14:17:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:06,973 INFO L471 AbstractCegarLoop]: Abstraction has 4766 states and 8037 transitions. [2025-03-03 14:17:06,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:17:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 4766 states and 8037 transitions. [2025-03-03 14:17:06,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:06,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:06,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:06,984 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:17:07,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:07,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:07,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash -238307186, now seen corresponding path program 1 times [2025-03-03 14:17:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:07,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351305821] [2025-03-03 14:17:07,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:07,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:07,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:07,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:07,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:07,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:07,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351305821] [2025-03-03 14:17:07,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351305821] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:07,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790591404] [2025-03-03 14:17:07,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:07,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:07,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:07,411 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:17:07,413 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:17:07,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:07,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:07,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:07,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:07,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:17:07,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:07,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790591404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2025-03-03 14:17:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232135722] [2025-03-03 14:17:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:07,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:07,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:07,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:07,669 INFO L87 Difference]: Start difference. First operand 4766 states and 8037 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:07,982 INFO L93 Difference]: Finished difference Result 14184 states and 24244 transitions. [2025-03-03 14:17:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-03 14:17:07,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:08,043 INFO L225 Difference]: With dead ends: 14184 [2025-03-03 14:17:08,046 INFO L226 Difference]: Without dead ends: 9439 [2025-03-03 14:17:08,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:08,071 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 811 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:08,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 1686 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9439 states. [2025-03-03 14:17:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9439 to 9336. [2025-03-03 14:17:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9336 states, 7228 states have (on average 1.6451300498063088) internal successors, (11891), 7556 states have internal predecessors, (11891), 1696 states have call successors, (1696), 394 states have call predecessors, (1696), 411 states have return successors, (2248), 1691 states have call predecessors, (2248), 1686 states have call successors, (2248) [2025-03-03 14:17:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9336 states to 9336 states and 15835 transitions. [2025-03-03 14:17:08,445 INFO L78 Accepts]: Start accepts. Automaton has 9336 states and 15835 transitions. Word has length 102 [2025-03-03 14:17:08,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:08,445 INFO L471 AbstractCegarLoop]: Abstraction has 9336 states and 15835 transitions. [2025-03-03 14:17:08,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:08,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9336 states and 15835 transitions. [2025-03-03 14:17:08,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:08,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:08,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:08,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:08,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:08,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:08,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash -743865811, now seen corresponding path program 1 times [2025-03-03 14:17:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:08,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747887895] [2025-03-03 14:17:08,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:08,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:08,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:08,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:08,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:08,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747887895] [2025-03-03 14:17:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747887895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504588965] [2025-03-03 14:17:08,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:08,818 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:17:08,818 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:17:08,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:09,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:09,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:09,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:09,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1578 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:17:09,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:09,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504588965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-03 14:17:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851802440] [2025-03-03 14:17:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:09,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:09,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:09,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:09,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:17:09,122 INFO L87 Difference]: Start difference. First operand 9336 states and 15835 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:17:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:09,611 INFO L93 Difference]: Finished difference Result 17641 states and 30008 transitions. [2025-03-03 14:17:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:17:09,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-03-03 14:17:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:09,657 INFO L225 Difference]: With dead ends: 17641 [2025-03-03 14:17:09,657 INFO L226 Difference]: Without dead ends: 8323 [2025-03-03 14:17:09,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:17:09,696 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 688 mSDsluCounter, 2458 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:09,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 3336 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:17:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8323 states. [2025-03-03 14:17:10,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8323 to 8301. [2025-03-03 14:17:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8301 states, 6449 states have (on average 1.6317258489688324) internal successors, (10523), 6724 states have internal predecessors, (10523), 1478 states have call successors, (1478), 358 states have call predecessors, (1478), 373 states have return successors, (1938), 1474 states have call predecessors, (1938), 1468 states have call successors, (1938) [2025-03-03 14:17:10,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8301 states to 8301 states and 13939 transitions. [2025-03-03 14:17:10,094 INFO L78 Accepts]: Start accepts. Automaton has 8301 states and 13939 transitions. Word has length 102 [2025-03-03 14:17:10,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:10,096 INFO L471 AbstractCegarLoop]: Abstraction has 8301 states and 13939 transitions. [2025-03-03 14:17:10,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:17:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 8301 states and 13939 transitions. [2025-03-03 14:17:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:17:10,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:10,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:10,108 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:17:10,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:17:10,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:10,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1282262945, now seen corresponding path program 1 times [2025-03-03 14:17:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555238742] [2025-03-03 14:17:10,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:10,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:17:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:17:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:10,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:10,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555238742] [2025-03-03 14:17:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555238742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:10,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058325195] [2025-03-03 14:17:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:10,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:10,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:10,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:10,390 INFO L87 Difference]: Start difference. First operand 8301 states and 13939 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:10,708 INFO L93 Difference]: Finished difference Result 16632 states and 28273 transitions. [2025-03-03 14:17:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:10,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-03 14:17:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:10,810 INFO L225 Difference]: With dead ends: 16632 [2025-03-03 14:17:10,811 INFO L226 Difference]: Without dead ends: 8349 [2025-03-03 14:17:10,834 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:17:10,835 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 12 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:10,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2402 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8349 states. [2025-03-03 14:17:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8349 to 8317. [2025-03-03 14:17:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8317 states, 6461 states have (on average 1.6299334468348552) internal successors, (10531), 6736 states have internal predecessors, (10531), 1478 states have call successors, (1478), 366 states have call predecessors, (1478), 377 states have return successors, (1912), 1470 states have call predecessors, (1912), 1468 states have call successors, (1912) [2025-03-03 14:17:11,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8317 states to 8317 states and 13921 transitions. [2025-03-03 14:17:11,048 INFO L78 Accepts]: Start accepts. Automaton has 8317 states and 13921 transitions. Word has length 102 [2025-03-03 14:17:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:11,049 INFO L471 AbstractCegarLoop]: Abstraction has 8317 states and 13921 transitions. [2025-03-03 14:17:11,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:17:11,049 INFO L276 IsEmpty]: Start isEmpty. Operand 8317 states and 13921 transitions. [2025-03-03 14:17:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:17:11,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:11,051 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:11,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:17:11,052 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:11,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:11,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1092362000, now seen corresponding path program 1 times [2025-03-03 14:17:11,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543731446] [2025-03-03 14:17:11,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:11,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:17:11,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:17:11,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:11,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:17:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543731446] [2025-03-03 14:17:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543731446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:11,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:11,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90340620] [2025-03-03 14:17:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:11,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:11,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:11,167 INFO L87 Difference]: Start difference. First operand 8317 states and 13921 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:11,944 INFO L93 Difference]: Finished difference Result 24897 states and 42861 transitions. [2025-03-03 14:17:11,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:11,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-03 14:17:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:12,045 INFO L225 Difference]: With dead ends: 24897 [2025-03-03 14:17:12,046 INFO L226 Difference]: Without dead ends: 16598 [2025-03-03 14:17:12,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:12,097 INFO L435 NwaCegarLoop]: 922 mSDtfsCounter, 810 mSDsluCounter, 3331 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 4253 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:12,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 4253 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:12,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16598 states. [2025-03-03 14:17:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16598 to 16497. [2025-03-03 14:17:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16497 states, 12828 states have (on average 1.6262862488306828) internal successors, (20862), 13369 states have internal predecessors, (20862), 2911 states have call successors, (2911), 726 states have call predecessors, (2911), 757 states have return successors, (4425), 2913 states have call predecessors, (4425), 2893 states have call successors, (4425) [2025-03-03 14:17:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16497 states to 16497 states and 28198 transitions. [2025-03-03 14:17:12,729 INFO L78 Accepts]: Start accepts. Automaton has 16497 states and 28198 transitions. Word has length 110 [2025-03-03 14:17:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 16497 states and 28198 transitions. [2025-03-03 14:17:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:17:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16497 states and 28198 transitions. [2025-03-03 14:17:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:17:12,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:12,733 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:12,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:17:12,733 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:12,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:12,734 INFO L85 PathProgramCache]: Analyzing trace with hash 232229956, now seen corresponding path program 1 times [2025-03-03 14:17:12,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:12,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5171460] [2025-03-03 14:17:12,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:12,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:12,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:17:12,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:17:12,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:12,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:17:12,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5171460] [2025-03-03 14:17:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5171460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949065704] [2025-03-03 14:17:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:12,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:12,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:12,891 INFO L87 Difference]: Start difference. First operand 16497 states and 28198 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:17:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:13,753 INFO L93 Difference]: Finished difference Result 33120 states and 57611 transitions. [2025-03-03 14:17:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:13,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-03-03 14:17:13,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:13,871 INFO L225 Difference]: With dead ends: 33120 [2025-03-03 14:17:13,872 INFO L226 Difference]: Without dead ends: 16641 [2025-03-03 14:17:13,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:17:13,996 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 12 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:13,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2396 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16641 states. [2025-03-03 14:17:14,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16641 to 16577. [2025-03-03 14:17:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16577 states, 12900 states have (on average 1.6234108527131783) internal successors, (20942), 13425 states have internal predecessors, (20942), 2911 states have call successors, (2911), 758 states have call predecessors, (2911), 765 states have return successors, (4385), 2905 states have call predecessors, (4385), 2893 states have call successors, (4385) [2025-03-03 14:17:14,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16577 states to 16577 states and 28238 transitions. [2025-03-03 14:17:14,770 INFO L78 Accepts]: Start accepts. Automaton has 16577 states and 28238 transitions. Word has length 111 [2025-03-03 14:17:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:14,770 INFO L471 AbstractCegarLoop]: Abstraction has 16577 states and 28238 transitions. [2025-03-03 14:17:14,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:17:14,771 INFO L276 IsEmpty]: Start isEmpty. Operand 16577 states and 28238 transitions. [2025-03-03 14:17:14,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:17:14,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:14,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:14,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:17:14,775 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:14,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:14,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2089562964, now seen corresponding path program 1 times [2025-03-03 14:17:14,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:14,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587642525] [2025-03-03 14:17:14,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:14,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:14,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:17:14,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:17:14,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:14,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:17:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587642525] [2025-03-03 14:17:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587642525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:14,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:14,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339619120] [2025-03-03 14:17:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:14,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:14,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:14,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:14,894 INFO L87 Difference]: Start difference. First operand 16577 states and 28238 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:17:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:16,206 INFO L93 Difference]: Finished difference Result 49817 states and 88358 transitions. [2025-03-03 14:17:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:16,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-03 14:17:16,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:16,403 INFO L225 Difference]: With dead ends: 49817 [2025-03-03 14:17:16,403 INFO L226 Difference]: Without dead ends: 33258 [2025-03-03 14:17:16,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:16,512 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 806 mSDsluCounter, 3324 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 4241 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:16,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 4241 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:17:16,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33258 states. [2025-03-03 14:17:17,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33258 to 33093. [2025-03-03 14:17:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33093 states, 25763 states have (on average 1.6196483328804876) internal successors, (41727), 26804 states have internal predecessors, (41727), 5788 states have call successors, (5788), 1510 states have call predecessors, (5788), 1541 states have return successors, (10627), 5802 states have call predecessors, (10627), 5754 states have call successors, (10627) [2025-03-03 14:17:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33093 states to 33093 states and 58142 transitions. [2025-03-03 14:17:17,974 INFO L78 Accepts]: Start accepts. Automaton has 33093 states and 58142 transitions. Word has length 120 [2025-03-03 14:17:17,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:17,974 INFO L471 AbstractCegarLoop]: Abstraction has 33093 states and 58142 transitions. [2025-03-03 14:17:17,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:17:17,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33093 states and 58142 transitions. [2025-03-03 14:17:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:17:17,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:17,979 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:17,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:17:17,980 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 2058358777, now seen corresponding path program 1 times [2025-03-03 14:17:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179533977] [2025-03-03 14:17:17,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:17,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:17:18,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:17:18,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:18,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:17:18,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:18,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179533977] [2025-03-03 14:17:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179533977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:18,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:18,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:18,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047072757] [2025-03-03 14:17:18,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:18,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:18,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:18,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:18,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:18,074 INFO L87 Difference]: Start difference. First operand 33093 states and 58142 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:20,120 INFO L93 Difference]: Finished difference Result 66456 states and 119940 transitions. [2025-03-03 14:17:20,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:20,120 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 121 [2025-03-03 14:17:20,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:20,306 INFO L225 Difference]: With dead ends: 66456 [2025-03-03 14:17:20,306 INFO L226 Difference]: Without dead ends: 33381 [2025-03-03 14:17:20,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:17:20,503 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 11 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2399 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:20,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2399 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33381 states. [2025-03-03 14:17:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33381 to 33253. [2025-03-03 14:17:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33253 states, 25907 states have (on average 1.616821708418574) internal successors, (41887), 26948 states have internal predecessors, (41887), 5788 states have call successors, (5788), 1542 states have call predecessors, (5788), 1557 states have return successors, (10571), 5786 states have call predecessors, (10571), 5754 states have call successors, (10571) [2025-03-03 14:17:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33253 states to 33253 states and 58246 transitions. [2025-03-03 14:17:21,625 INFO L78 Accepts]: Start accepts. Automaton has 33253 states and 58246 transitions. Word has length 121 [2025-03-03 14:17:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:21,625 INFO L471 AbstractCegarLoop]: Abstraction has 33253 states and 58246 transitions. [2025-03-03 14:17:21,625 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 14:17:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 33253 states and 58246 transitions. [2025-03-03 14:17:21,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:17:21,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:21,632 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:21,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:17:21,632 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:21,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1558455287, now seen corresponding path program 1 times [2025-03-03 14:17:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134751283] [2025-03-03 14:17:21,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:21,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:21,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:17:21,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:17:21,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:21,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:21,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:17:21,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:21,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134751283] [2025-03-03 14:17:21,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134751283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:21,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:21,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061867685] [2025-03-03 14:17:21,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:21,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:21,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:21,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:21,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:21,763 INFO L87 Difference]: Start difference. First operand 33253 states and 58246 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:17:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:25,167 INFO L93 Difference]: Finished difference Result 100081 states and 186178 transitions. [2025-03-03 14:17:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:25,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2025-03-03 14:17:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:25,966 INFO L225 Difference]: With dead ends: 100081 [2025-03-03 14:17:25,966 INFO L226 Difference]: Without dead ends: 66846 [2025-03-03 14:17:26,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:26,172 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 801 mSDsluCounter, 3339 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 4258 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:26,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 4258 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:17:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66846 states. [2025-03-03 14:17:28,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66846 to 66553. [2025-03-03 14:17:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66553 states, 51858 states have (on average 1.6139457750009643) internal successors, (83696), 53931 states have internal predecessors, (83696), 11553 states have call successors, (11553), 3078 states have call predecessors, (11553), 3141 states have return successors, (26785), 11591 states have call predecessors, (26785), 11487 states have call successors, (26785) [2025-03-03 14:17:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66553 states to 66553 states and 122034 transitions. [2025-03-03 14:17:29,172 INFO L78 Accepts]: Start accepts. Automaton has 66553 states and 122034 transitions. Word has length 131 [2025-03-03 14:17:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:29,173 INFO L471 AbstractCegarLoop]: Abstraction has 66553 states and 122034 transitions. [2025-03-03 14:17:29,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:17:29,173 INFO L276 IsEmpty]: Start isEmpty. Operand 66553 states and 122034 transitions. [2025-03-03 14:17:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:17:29,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:29,179 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:29,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:17:29,179 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:29,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 449625423, now seen corresponding path program 1 times [2025-03-03 14:17:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:29,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251131216] [2025-03-03 14:17:29,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:17:29,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:17:29,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:29,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:17:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251131216] [2025-03-03 14:17:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251131216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147099785] [2025-03-03 14:17:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:29,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:29,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:29,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:29,265 INFO L87 Difference]: Start difference. First operand 66553 states and 122034 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:17:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:33,691 INFO L93 Difference]: Finished difference Result 133728 states and 255505 transitions. [2025-03-03 14:17:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:33,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2025-03-03 14:17:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:34,152 INFO L225 Difference]: With dead ends: 133728 [2025-03-03 14:17:34,152 INFO L226 Difference]: Without dead ends: 67193 [2025-03-03 14:17:34,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:17:34,877 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 9 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:34,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2396 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67193 states. [2025-03-03 14:17:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67193 to 66937. [2025-03-03 14:17:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66937 states, 52210 states have (on average 1.6104194598735875) internal successors, (84080), 54283 states have internal predecessors, (84080), 11553 states have call successors, (11553), 3142 states have call predecessors, (11553), 3173 states have return successors, (26721), 11559 states have call predecessors, (26721), 11487 states have call successors, (26721) [2025-03-03 14:17:38,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66937 states to 66937 states and 122354 transitions. [2025-03-03 14:17:38,052 INFO L78 Accepts]: Start accepts. Automaton has 66937 states and 122354 transitions. Word has length 132 [2025-03-03 14:17:38,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:38,053 INFO L471 AbstractCegarLoop]: Abstraction has 66937 states and 122354 transitions. [2025-03-03 14:17:38,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-03 14:17:38,053 INFO L276 IsEmpty]: Start isEmpty. Operand 66937 states and 122354 transitions. [2025-03-03 14:17:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:17:38,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:38,061 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:17:38,061 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:38,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1698577035, now seen corresponding path program 1 times [2025-03-03 14:17:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030555266] [2025-03-03 14:17:38,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:17:38,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:17:38,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:38,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:38,274 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:17:38,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:38,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030555266] [2025-03-03 14:17:38,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030555266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:38,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:38,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:17:38,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341123471] [2025-03-03 14:17:38,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:38,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:17:38,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:38,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:17:38,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:17:38,276 INFO L87 Difference]: Start difference. First operand 66937 states and 122354 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:17:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:42,200 INFO L93 Difference]: Finished difference Result 136433 states and 251459 transitions. [2025-03-03 14:17:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:42,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 143 [2025-03-03 14:17:42,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:42,602 INFO L225 Difference]: With dead ends: 136433 [2025-03-03 14:17:42,602 INFO L226 Difference]: Without dead ends: 69466 [2025-03-03 14:17:43,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:17:43,202 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 674 mSDsluCounter, 2478 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 3352 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:43,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 3352 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:17:43,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69466 states.