./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product25.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_spec9_product25.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 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:18:45,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:18:45,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:18:45,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:18:45,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:18:46,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:18:46,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:18:46,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:18:46,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:18:46,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:18:46,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:18:46,019 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:18:46,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:18:46,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:18:46,019 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:18:46,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:18:46,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:18:46,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:18:46,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:46,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:18:46,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:18:46,022 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 -> 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a [2025-03-03 14:18:46,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:18:46,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:18:46,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:18:46,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:18:46,248 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:18:46,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2025-03-03 14:18:47,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9fc74f2/b7d708a3a9664096b622ce11f12e16d7/FLAGb85ac070d [2025-03-03 14:18:47,712 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:47,715 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2025-03-03 14:18:47,737 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9fc74f2/b7d708a3a9664096b622ce11f12e16d7/FLAGb85ac070d [2025-03-03 14:18:47,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f9fc74f2/b7d708a3a9664096b622ce11f12e16d7 [2025-03-03 14:18:47,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:47,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:47,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:47,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:47,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:47,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:47" (1/1) ... [2025-03-03 14:18:47,932 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bdde71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:47, skipping insertion in model container [2025-03-03 14:18:47,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:47" (1/1) ... [2025-03-03 14:18:47,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:48,283 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_spec9_product25.cil.c[23488,23501] [2025-03-03 14:18:48,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:48,423 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:48,432 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [48] [2025-03-03 14:18:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [213] [2025-03-03 14:18:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [334] [2025-03-03 14:18:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [432] [2025-03-03 14:18:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [446] [2025-03-03 14:18:48,434 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [812] [2025-03-03 14:18:48,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1166] [2025-03-03 14:18:48,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1175] [2025-03-03 14:18:48,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1842] [2025-03-03 14:18:48,435 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1877] [2025-03-03 14:18:48,470 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_spec9_product25.cil.c[23488,23501] [2025-03-03 14:18:48,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:48,542 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:48,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48 WrapperNode [2025-03-03 14:18:48,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:48,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:48,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:48,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:48,548 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:18:48" (1/1) ... [2025-03-03 14:18:48,567 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:18:48" (1/1) ... [2025-03-03 14:18:48,592 INFO L138 Inliner]: procedures = 91, calls = 331, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 801 [2025-03-03 14:18:48,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:48,594 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:48,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:48,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:48,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,638 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:18:48,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,669 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:48,685 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:48,685 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:48,685 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:48,686 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (1/1) ... [2025-03-03 14:18:48,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:48,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:48,716 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:18:48,719 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:18:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:18:48,739 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:18:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:18:48,739 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:18:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:48,740 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:48,740 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:48,740 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:48,740 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:48,741 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:48,741 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:48,741 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:48,741 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:48,741 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:48,741 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:48,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:48,741 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:48,742 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:48,742 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:48,742 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:48,742 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:48,743 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:48,743 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:48,743 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:48,743 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:48,743 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:48,743 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:48,744 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-03 14:18:48,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:48,744 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:48,744 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:48,744 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:48,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:48,744 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:48,745 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:48,898 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:48,900 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:48,959 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L331: #res := ~retValue_acc~2; [2025-03-03 14:18:48,986 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L253: #res := ~retValue_acc~0; [2025-03-03 14:18:48,990 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1948: #res := ~retValue_acc~13; [2025-03-03 14:18:49,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: #res := ~retValue_acc~21; [2025-03-03 14:18:49,364 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2766: #res := ~retValue_acc~24; [2025-03-03 14:18:49,376 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L292: #res := ~retValue_acc~1; [2025-03-03 14:18:49,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2217: #res := ~retValue_acc~18; [2025-03-03 14:18:49,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2297-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:18:49,514 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2310-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:18:49,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~23#1; [2025-03-03 14:18:49,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2125-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~14#1; [2025-03-03 14:18:49,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2134-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-03-03 14:18:49,628 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2168-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~16#1; [2025-03-03 14:18:49,674 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1528: #res := ~retValue_acc~9; [2025-03-03 14:18:49,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1163-1: main_#res#1 := main_~retValue_acc~7#1; [2025-03-03 14:18:49,731 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1874-1: valid_product_#res#1 := valid_product_~retValue_acc~12#1; [2025-03-03 14:18:49,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1292: #res := ~retValue_acc~8; [2025-03-03 14:18:49,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1839: #res := ~retValue_acc~10; [2025-03-03 14:18:49,838 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:49,839 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:49,865 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:49,865 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:49,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:49 BoogieIcfgContainer [2025-03-03 14:18:49,866 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:49,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:49,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:49,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:49,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:47" (1/3) ... [2025-03-03 14:18:49,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d747e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:49, skipping insertion in model container [2025-03-03 14:18:49,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:48" (2/3) ... [2025-03-03 14:18:49,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d747e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:49, skipping insertion in model container [2025-03-03 14:18:49,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:49" (3/3) ... [2025-03-03 14:18:49,875 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2025-03-03 14:18:49,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:49,890 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product25.cil.c that has 22 procedures, 531 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:49,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:49,948 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;@2b211513, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:49,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand has 531 states, 423 states have (on average 1.7139479905437351) internal successors, (725), 444 states have internal predecessors, (725), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2025-03-03 14:18:49,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:18:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:49,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:49,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:49,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -767418683, now seen corresponding path program 1 times [2025-03-03 14:18:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257777272] [2025-03-03 14:18:49,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:50,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:18:50,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:18:50,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:50,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:50,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257777272] [2025-03-03 14:18:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257777272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:50,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437793640] [2025-03-03 14:18:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:50,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:50,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:50,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:50,461 INFO L87 Difference]: Start difference. First operand has 531 states, 423 states have (on average 1.7139479905437351) internal successors, (725), 444 states have internal predecessors, (725), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:50,587 INFO L93 Difference]: Finished difference Result 1042 states and 1765 transitions. [2025-03-03 14:18:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:50,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-03 14:18:50,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:50,609 INFO L225 Difference]: With dead ends: 1042 [2025-03-03 14:18:50,610 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 14:18:50,617 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:18:50,619 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 5 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2621 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:50,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2621 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 14:18:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-03 14:18:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7122302158273381) internal successors, (714), 436 states have internal predecessors, (714), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 879 transitions. [2025-03-03 14:18:50,702 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 879 transitions. Word has length 76 [2025-03-03 14:18:50,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:50,702 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 879 transitions. [2025-03-03 14:18:50,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 879 transitions. [2025-03-03 14:18:50,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:18:50,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:50,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:50,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:50,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:50,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:50,710 INFO L85 PathProgramCache]: Analyzing trace with hash -126114207, now seen corresponding path program 1 times [2025-03-03 14:18:50,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:50,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142197058] [2025-03-03 14:18:50,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:50,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:50,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:50,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:50,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:50,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:50,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:50,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:50,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142197058] [2025-03-03 14:18:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142197058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932227288] [2025-03-03 14:18:50,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:50,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:50,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:50,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:50,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:50,920 INFO L87 Difference]: Start difference. First operand 523 states and 879 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:50,979 INFO L93 Difference]: Finished difference Result 1028 states and 1735 transitions. [2025-03-03 14:18:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-03 14:18:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:50,986 INFO L225 Difference]: With dead ends: 1028 [2025-03-03 14:18:50,986 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 14:18:50,989 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:18:50,989 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 4 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:50,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2600 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 14:18:51,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-03 14:18:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.709832134292566) internal successors, (713), 436 states have internal predecessors, (713), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 878 transitions. [2025-03-03 14:18:51,011 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 878 transitions. Word has length 79 [2025-03-03 14:18:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 878 transitions. [2025-03-03 14:18:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 878 transitions. [2025-03-03 14:18:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:18:51,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:51,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:51,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:51,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:51,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:51,015 INFO L85 PathProgramCache]: Analyzing trace with hash 286160831, now seen corresponding path program 1 times [2025-03-03 14:18:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:51,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573766068] [2025-03-03 14:18:51,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:51,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:18:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:18:51,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:51,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:51,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:51,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:51,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573766068] [2025-03-03 14:18:51,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573766068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:51,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:51,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:51,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575519638] [2025-03-03 14:18:51,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:51,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:51,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:51,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:51,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:51,183 INFO L87 Difference]: Start difference. First operand 523 states and 878 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:51,233 INFO L93 Difference]: Finished difference Result 1028 states and 1734 transitions. [2025-03-03 14:18:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-03 14:18:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:51,239 INFO L225 Difference]: With dead ends: 1028 [2025-03-03 14:18:51,239 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 14:18:51,241 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:18:51,243 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 3 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2600 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:18:51,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2600 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 14:18:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-03 14:18:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7074340527577938) internal successors, (712), 436 states have internal predecessors, (712), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 877 transitions. [2025-03-03 14:18:51,271 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 877 transitions. Word has length 80 [2025-03-03 14:18:51,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:51,272 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 877 transitions. [2025-03-03 14:18:51,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 877 transitions. [2025-03-03 14:18:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:18:51,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:51,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:51,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:18:51,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:51,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1115528514, now seen corresponding path program 1 times [2025-03-03 14:18:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258794378] [2025-03-03 14:18:51,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:51,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:18:51,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:18:51,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:51,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:51,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:51,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258794378] [2025-03-03 14:18:51,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258794378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:51,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:51,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:51,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453906748] [2025-03-03 14:18:51,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:51,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:51,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:51,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:51,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:51,403 INFO L87 Difference]: Start difference. First operand 523 states and 877 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:51,449 INFO L93 Difference]: Finished difference Result 1028 states and 1733 transitions. [2025-03-03 14:18:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:51,449 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-03 14:18:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:51,453 INFO L225 Difference]: With dead ends: 1028 [2025-03-03 14:18:51,453 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 14:18:51,456 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:18:51,457 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 2 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:51,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2600 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 14:18:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-03 14:18:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7050359712230216) internal successors, (711), 436 states have internal predecessors, (711), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 876 transitions. [2025-03-03 14:18:51,481 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 876 transitions. Word has length 81 [2025-03-03 14:18:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 876 transitions. [2025-03-03 14:18:51,481 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 876 transitions. [2025-03-03 14:18:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 14:18:51,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:51,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:51,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:18:51,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:51,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1379428412, now seen corresponding path program 1 times [2025-03-03 14:18:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:51,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473441865] [2025-03-03 14:18:51,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:51,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:51,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 14:18:51,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 14:18:51,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:51,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473441865] [2025-03-03 14:18:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473441865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606055932] [2025-03-03 14:18:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:51,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:51,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:51,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:51,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:51,620 INFO L87 Difference]: Start difference. First operand 523 states and 876 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:51,664 INFO L93 Difference]: Finished difference Result 1028 states and 1732 transitions. [2025-03-03 14:18:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-03-03 14:18:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:51,668 INFO L225 Difference]: With dead ends: 1028 [2025-03-03 14:18:51,669 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 14:18:51,671 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:18:51,671 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 1 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2600 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:51,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2600 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:51,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 14:18:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2025-03-03 14:18:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 417 states have (on average 1.7026378896882495) internal successors, (710), 436 states have internal predecessors, (710), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 875 transitions. [2025-03-03 14:18:51,691 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 875 transitions. Word has length 82 [2025-03-03 14:18:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:51,691 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 875 transitions. [2025-03-03 14:18:51,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 875 transitions. [2025-03-03 14:18:51,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:18:51,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:51,694 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:51,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:18:51,694 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:51,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:51,695 INFO L85 PathProgramCache]: Analyzing trace with hash 116368155, now seen corresponding path program 1 times [2025-03-03 14:18:51,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:51,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927756780] [2025-03-03 14:18:51,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:51,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:18:51,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:18:51,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:51,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927756780] [2025-03-03 14:18:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927756780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:51,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:18:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842113201] [2025-03-03 14:18:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:51,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:18:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:51,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:18:51,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:51,913 INFO L87 Difference]: Start difference. First operand 523 states and 875 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:52,027 INFO L93 Difference]: Finished difference Result 994 states and 1664 transitions. [2025-03-03 14:18:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:18:52,028 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-03-03 14:18:52,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:52,032 INFO L225 Difference]: With dead ends: 994 [2025-03-03 14:18:52,032 INFO L226 Difference]: Without dead ends: 538 [2025-03-03 14:18:52,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:52,035 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 91 mSDsluCounter, 5958 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6821 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:52,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6821 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:52,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-03 14:18:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 536. [2025-03-03 14:18:52,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 427 states have (on average 1.6978922716627636) internal successors, (725), 448 states have internal predecessors, (725), 86 states have call successors, (86), 21 states have call predecessors, (86), 22 states have return successors, (83), 79 states have call predecessors, (83), 81 states have call successors, (83) [2025-03-03 14:18:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 894 transitions. [2025-03-03 14:18:52,060 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 894 transitions. Word has length 83 [2025-03-03 14:18:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:52,061 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 894 transitions. [2025-03-03 14:18:52,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 894 transitions. [2025-03-03 14:18:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:18:52,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:52,065 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:52,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:18:52,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:52,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:52,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1897868090, now seen corresponding path program 1 times [2025-03-03 14:18:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414802895] [2025-03-03 14:18:52,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:52,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:18:52,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:18:52,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:52,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414802895] [2025-03-03 14:18:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414802895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:52,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:52,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316645158] [2025-03-03 14:18:52,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:52,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:52,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:52,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:52,157 INFO L87 Difference]: Start difference. First operand 536 states and 894 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:52,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:52,191 INFO L93 Difference]: Finished difference Result 1046 states and 1758 transitions. [2025-03-03 14:18:52,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:52,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2025-03-03 14:18:52,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:52,195 INFO L225 Difference]: With dead ends: 1046 [2025-03-03 14:18:52,196 INFO L226 Difference]: Without dead ends: 517 [2025-03-03 14:18:52,198 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:18:52,199 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 0 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2602 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:52,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2602 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-03-03 14:18:52,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2025-03-03 14:18:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.6934306569343065) internal successors, (696), 430 states have internal predecessors, (696), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 861 transitions. [2025-03-03 14:18:52,217 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 861 transitions. Word has length 83 [2025-03-03 14:18:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:52,217 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 861 transitions. [2025-03-03 14:18:52,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 861 transitions. [2025-03-03 14:18:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:18:52,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:52,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:52,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:18:52,220 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:52,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1544008431, now seen corresponding path program 1 times [2025-03-03 14:18:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:52,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641899127] [2025-03-03 14:18:52,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:52,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:52,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:18:52,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:18:52,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:52,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:52,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641899127] [2025-03-03 14:18:52,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641899127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754181937] [2025-03-03 14:18:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:52,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:52,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:52,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:52,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:52,372 INFO L87 Difference]: Start difference. First operand 517 states and 861 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:52,725 INFO L93 Difference]: Finished difference Result 991 states and 1656 transitions. [2025-03-03 14:18:52,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:52,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-03 14:18:52,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:52,729 INFO L225 Difference]: With dead ends: 991 [2025-03-03 14:18:52,729 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 14:18:52,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:52,731 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 55 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4061 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:52,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4061 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:52,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 14:18:52,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-03-03 14:18:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.683698296836983) internal successors, (692), 430 states have internal predecessors, (692), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 857 transitions. [2025-03-03 14:18:52,748 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 857 transitions. Word has length 84 [2025-03-03 14:18:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:52,748 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 857 transitions. [2025-03-03 14:18:52,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 857 transitions. [2025-03-03 14:18:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:18:52,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:52,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:52,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:18:52,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:52,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1284219726, now seen corresponding path program 1 times [2025-03-03 14:18:52,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:52,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210383018] [2025-03-03 14:18:52,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:52,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:18:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:18:52,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:52,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:52,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:52,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210383018] [2025-03-03 14:18:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210383018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:52,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069264349] [2025-03-03 14:18:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:52,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:52,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:52,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:52,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:52,876 INFO L87 Difference]: Start difference. First operand 517 states and 857 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:53,026 INFO L93 Difference]: Finished difference Result 991 states and 1652 transitions. [2025-03-03 14:18:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:53,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-03 14:18:53,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:53,030 INFO L225 Difference]: With dead ends: 991 [2025-03-03 14:18:53,030 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 14:18:53,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:53,033 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 54 mSDsluCounter, 3243 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4061 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:53,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4061 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 14:18:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-03-03 14:18:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.6739659367396593) internal successors, (688), 430 states have internal predecessors, (688), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 853 transitions. [2025-03-03 14:18:53,053 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 853 transitions. Word has length 85 [2025-03-03 14:18:53,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:53,053 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 853 transitions. [2025-03-03 14:18:53,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 853 transitions. [2025-03-03 14:18:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:18:53,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:53,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:53,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:18:53,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:53,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:53,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1742178508, now seen corresponding path program 1 times [2025-03-03 14:18:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828278020] [2025-03-03 14:18:53,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:53,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:53,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:18:53,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:18:53,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:53,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:53,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:53,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828278020] [2025-03-03 14:18:53,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828278020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:53,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:53,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:53,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094552243] [2025-03-03 14:18:53,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:53,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:53,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:53,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:53,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:53,163 INFO L87 Difference]: Start difference. First operand 517 states and 853 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:53,291 INFO L93 Difference]: Finished difference Result 991 states and 1648 transitions. [2025-03-03 14:18:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:53,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-03 14:18:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:53,296 INFO L225 Difference]: With dead ends: 991 [2025-03-03 14:18:53,296 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 14:18:53,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:53,298 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 53 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4043 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:53,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4043 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:53,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 14:18:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 517. [2025-03-03 14:18:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 411 states have (on average 1.6642335766423357) internal successors, (684), 430 states have internal predecessors, (684), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 849 transitions. [2025-03-03 14:18:53,313 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 849 transitions. Word has length 86 [2025-03-03 14:18:53,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:53,313 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 849 transitions. [2025-03-03 14:18:53,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 849 transitions. [2025-03-03 14:18:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:18:53,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:53,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:53,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:18:53,315 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:53,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:53,316 INFO L85 PathProgramCache]: Analyzing trace with hash -877697629, now seen corresponding path program 1 times [2025-03-03 14:18:53,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:53,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130163237] [2025-03-03 14:18:53,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:53,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:53,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:18:53,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:18:53,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:53,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130163237] [2025-03-03 14:18:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130163237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:53,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573292688] [2025-03-03 14:18:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:53,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:53,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:53,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:53,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:53,445 INFO L87 Difference]: Start difference. First operand 517 states and 849 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:53,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:53,510 INFO L93 Difference]: Finished difference Result 982 states and 1630 transitions. [2025-03-03 14:18:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:53,511 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2025-03-03 14:18:53,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:53,514 INFO L225 Difference]: With dead ends: 982 [2025-03-03 14:18:53,514 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 14:18:53,517 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:18:53,518 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 84 mSDsluCounter, 4117 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:53,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4955 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 14:18:53,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-03 14:18:53,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6666666666666667) internal successors, (650), 409 states have internal predecessors, (650), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 815 transitions. [2025-03-03 14:18:53,534 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 815 transitions. Word has length 86 [2025-03-03 14:18:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:53,535 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 815 transitions. [2025-03-03 14:18:53,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:53,535 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 815 transitions. [2025-03-03 14:18:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:18:53,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:53,537 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:53,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:18:53,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:53,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1319494389, now seen corresponding path program 1 times [2025-03-03 14:18:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428417805] [2025-03-03 14:18:53,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:53,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:18:53,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:18:53,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:53,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:53,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428417805] [2025-03-03 14:18:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428417805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:53,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904061918] [2025-03-03 14:18:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:53,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:53,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:53,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:53,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:53,646 INFO L87 Difference]: Start difference. First operand 496 states and 815 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:53,707 INFO L93 Difference]: Finished difference Result 961 states and 1596 transitions. [2025-03-03 14:18:53,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2025-03-03 14:18:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:53,712 INFO L225 Difference]: With dead ends: 961 [2025-03-03 14:18:53,712 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 14:18:53,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:53,715 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 17 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3981 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:53,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3981 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 14:18:53,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-03 14:18:53,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6641025641025642) internal successors, (649), 409 states have internal predecessors, (649), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 814 transitions. [2025-03-03 14:18:53,731 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 814 transitions. Word has length 87 [2025-03-03 14:18:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 814 transitions. [2025-03-03 14:18:53,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 814 transitions. [2025-03-03 14:18:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:18:53,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:53,733 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:18:53,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:53,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1820599639, now seen corresponding path program 1 times [2025-03-03 14:18:53,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:53,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608562153] [2025-03-03 14:18:53,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:53,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:53,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:18:53,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:18:53,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:53,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:53,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:53,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608562153] [2025-03-03 14:18:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608562153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54870598] [2025-03-03 14:18:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:53,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:53,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:53,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:53,829 INFO L87 Difference]: Start difference. First operand 496 states and 814 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:53,890 INFO L93 Difference]: Finished difference Result 961 states and 1595 transitions. [2025-03-03 14:18:53,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:53,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-03 14:18:53,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:53,894 INFO L225 Difference]: With dead ends: 961 [2025-03-03 14:18:53,894 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 14:18:53,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:53,896 INFO L435 NwaCegarLoop]: 798 mSDtfsCounter, 16 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3981 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:53,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3981 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 14:18:53,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-03 14:18:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.6615384615384616) internal successors, (648), 409 states have internal predecessors, (648), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 813 transitions. [2025-03-03 14:18:53,912 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 813 transitions. Word has length 88 [2025-03-03 14:18:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:53,913 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 813 transitions. [2025-03-03 14:18:53,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:53,913 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 813 transitions. [2025-03-03 14:18:53,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:18:53,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:53,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:53,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:18:53,916 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:53,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 253519160, now seen corresponding path program 1 times [2025-03-03 14:18:53,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:53,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483917725] [2025-03-03 14:18:53,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:53,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:18:53,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:18:53,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:53,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:54,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:54,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483917725] [2025-03-03 14:18:54,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483917725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:54,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:54,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:18:54,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600828452] [2025-03-03 14:18:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:54,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:18:54,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:54,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:18:54,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:54,107 INFO L87 Difference]: Start difference. First operand 496 states and 813 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:54,187 INFO L93 Difference]: Finished difference Result 955 states and 1583 transitions. [2025-03-03 14:18:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:18:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2025-03-03 14:18:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:54,191 INFO L225 Difference]: With dead ends: 955 [2025-03-03 14:18:54,191 INFO L226 Difference]: Without dead ends: 496 [2025-03-03 14:18:54,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:54,194 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 6 mSDsluCounter, 6354 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7151 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:54,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7151 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:54,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-03 14:18:54,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2025-03-03 14:18:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 390 states have (on average 1.658974358974359) internal successors, (647), 409 states have internal predecessors, (647), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 14:18:54,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 812 transitions. [2025-03-03 14:18:54,207 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 812 transitions. Word has length 89 [2025-03-03 14:18:54,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:54,207 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 812 transitions. [2025-03-03 14:18:54,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:54,208 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 812 transitions. [2025-03-03 14:18:54,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:18:54,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:54,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:54,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:18:54,210 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:54,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash 425675690, now seen corresponding path program 1 times [2025-03-03 14:18:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:54,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968137050] [2025-03-03 14:18:54,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:54,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:54,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:18:54,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:18:54,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:54,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:54,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968137050] [2025-03-03 14:18:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968137050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:54,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:54,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:18:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474534495] [2025-03-03 14:18:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:54,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:18:54,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:54,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:18:54,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:18:54,375 INFO L87 Difference]: Start difference. First operand 496 states and 812 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:55,690 INFO L93 Difference]: Finished difference Result 951 states and 1595 transitions. [2025-03-03 14:18:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 90 [2025-03-03 14:18:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:55,696 INFO L225 Difference]: With dead ends: 951 [2025-03-03 14:18:55,696 INFO L226 Difference]: Without dead ends: 500 [2025-03-03 14:18:55,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:18:55,699 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 1260 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2538 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 2888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 2538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:55,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1260 Valid, 1540 Invalid, 2888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 2538 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:18:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-03 14:18:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2025-03-03 14:18:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 393 states have (on average 1.6539440203562341) internal successors, (650), 412 states have internal predecessors, (650), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (96), 79 states have call predecessors, (96), 80 states have call successors, (96) [2025-03-03 14:18:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 831 transitions. [2025-03-03 14:18:55,724 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 831 transitions. Word has length 90 [2025-03-03 14:18:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:55,725 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 831 transitions. [2025-03-03 14:18:55,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 831 transitions. [2025-03-03 14:18:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:18:55,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:55,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:55,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:18:55,727 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:55,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1002913307, now seen corresponding path program 1 times [2025-03-03 14:18:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687075932] [2025-03-03 14:18:55,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:55,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:18:55,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:18:55,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:55,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:55,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:55,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687075932] [2025-03-03 14:18:55,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687075932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:55,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:55,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:55,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45934184] [2025-03-03 14:18:55,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:55,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:55,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:55,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:55,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:55,855 INFO L87 Difference]: Start difference. First operand 500 states and 831 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:58,429 INFO L93 Difference]: Finished difference Result 1767 states and 3032 transitions. [2025-03-03 14:18:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:18:58,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2025-03-03 14:18:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:58,438 INFO L225 Difference]: With dead ends: 1767 [2025-03-03 14:18:58,439 INFO L226 Difference]: Without dead ends: 1312 [2025-03-03 14:18:58,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:18:58,442 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2266 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 5184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:58,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 2343 Invalid, 5184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 14:18:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2025-03-03 14:18:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1253. [2025-03-03 14:18:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 982 states have (on average 1.6659877800407332) internal successors, (1636), 1030 states have internal predecessors, (1636), 216 states have call successors, (216), 54 states have call predecessors, (216), 54 states have return successors, (231), 205 states have call predecessors, (231), 211 states have call successors, (231) [2025-03-03 14:18:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 2083 transitions. [2025-03-03 14:18:58,504 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 2083 transitions. Word has length 91 [2025-03-03 14:18:58,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,504 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 2083 transitions. [2025-03-03 14:18:58,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:58,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 2083 transitions. [2025-03-03 14:18:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:18:58,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:18:58,506 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2126354199, now seen corresponding path program 1 times [2025-03-03 14:18:58,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041209747] [2025-03-03 14:18:58,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:18:58,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:18:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:58,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:58,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041209747] [2025-03-03 14:18:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041209747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:58,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364487396] [2025-03-03 14:18:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:58,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:58,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:58,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:58,637 INFO L87 Difference]: Start difference. First operand 1253 states and 2083 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:19:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:01,613 INFO L93 Difference]: Finished difference Result 5776 states and 9920 transitions. [2025-03-03 14:19:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:19:01,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2025-03-03 14:19:01,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:01,638 INFO L225 Difference]: With dead ends: 5776 [2025-03-03 14:19:01,639 INFO L226 Difference]: Without dead ends: 4568 [2025-03-03 14:19:01,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:19:01,645 INFO L435 NwaCegarLoop]: 745 mSDtfsCounter, 2994 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 5292 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3113 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 6064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 5292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:01,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3113 Valid, 2642 Invalid, 6064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 5292 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 14:19:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2025-03-03 14:19:01,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 4089. [2025-03-03 14:19:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 3031 states have (on average 1.6601781590234246) internal successors, (5032), 3243 states have internal predecessors, (5032), 895 states have call successors, (895), 146 states have call predecessors, (895), 162 states have return successors, (1089), 873 states have call predecessors, (1089), 890 states have call successors, (1089) [2025-03-03 14:19:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 7016 transitions. [2025-03-03 14:19:01,842 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 7016 transitions. Word has length 93 [2025-03-03 14:19:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:01,842 INFO L471 AbstractCegarLoop]: Abstraction has 4089 states and 7016 transitions. [2025-03-03 14:19:01,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:19:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 7016 transitions. [2025-03-03 14:19:01,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:19:01,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:01,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:01,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:19:01,845 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:01,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1702707477, now seen corresponding path program 1 times [2025-03-03 14:19:01,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:01,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485208109] [2025-03-03 14:19:01,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:01,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:01,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:19:01,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:19:01,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:01,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:01,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485208109] [2025-03-03 14:19:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485208109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575118624] [2025-03-03 14:19:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:01,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:01,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:01,965 INFO L87 Difference]: Start difference. First operand 4089 states and 7016 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:19:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:04,082 INFO L93 Difference]: Finished difference Result 10798 states and 18654 transitions. [2025-03-03 14:19:04,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:19:04,082 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2025-03-03 14:19:04,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:04,130 INFO L225 Difference]: With dead ends: 10798 [2025-03-03 14:19:04,130 INFO L226 Difference]: Without dead ends: 7846 [2025-03-03 14:19:04,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:19:04,146 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 2283 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:04,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 1560 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:19:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7846 states. [2025-03-03 14:19:04,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7846 to 7547. [2025-03-03 14:19:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7547 states, 5632 states have (on average 1.658203125) internal successors, (9339), 6022 states have internal predecessors, (9339), 1587 states have call successors, (1587), 269 states have call predecessors, (1587), 327 states have return successors, (2060), 1546 states have call predecessors, (2060), 1582 states have call successors, (2060) [2025-03-03 14:19:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7547 states to 7547 states and 12986 transitions. [2025-03-03 14:19:04,494 INFO L78 Accepts]: Start accepts. Automaton has 7547 states and 12986 transitions. Word has length 93 [2025-03-03 14:19:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:04,496 INFO L471 AbstractCegarLoop]: Abstraction has 7547 states and 12986 transitions. [2025-03-03 14:19:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:19:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 7547 states and 12986 transitions. [2025-03-03 14:19:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:19:04,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:04,498 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:04,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:19:04,499 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:04,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1344627926, now seen corresponding path program 1 times [2025-03-03 14:19:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470691944] [2025-03-03 14:19:04,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:04,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:19:04,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:19:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470691944] [2025-03-03 14:19:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470691944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:04,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394597829] [2025-03-03 14:19:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:04,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:04,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:04,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:04,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:04,613 INFO L87 Difference]: Start difference. First operand 7547 states and 12986 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:19:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:04,906 INFO L93 Difference]: Finished difference Result 13879 states and 23946 transitions. [2025-03-03 14:19:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-03-03 14:19:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:04,956 INFO L225 Difference]: With dead ends: 13879 [2025-03-03 14:19:04,956 INFO L226 Difference]: Without dead ends: 7634 [2025-03-03 14:19:04,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:04,982 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 0 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:04,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3210 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:04,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7634 states. [2025-03-03 14:19:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7634 to 7620. [2025-03-03 14:19:05,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 5688 states have (on average 1.651195499296765) internal successors, (9392), 6077 states have internal predecessors, (9392), 1584 states have call successors, (1584), 269 states have call predecessors, (1584), 347 states have return successors, (2123), 1564 states have call predecessors, (2123), 1579 states have call successors, (2123) [2025-03-03 14:19:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 13099 transitions. [2025-03-03 14:19:05,295 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 13099 transitions. Word has length 98 [2025-03-03 14:19:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:05,296 INFO L471 AbstractCegarLoop]: Abstraction has 7620 states and 13099 transitions. [2025-03-03 14:19:05,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:19:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 13099 transitions. [2025-03-03 14:19:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:19:05,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:05,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:05,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:19:05,298 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:05,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1338735442, now seen corresponding path program 1 times [2025-03-03 14:19:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:05,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453258611] [2025-03-03 14:19:05,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:05,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:05,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:19:05,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:19:05,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:05,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:19:05,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:05,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453258611] [2025-03-03 14:19:05,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453258611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:05,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:05,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:19:05,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362992300] [2025-03-03 14:19:05,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:05,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:19:05,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:05,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:19:05,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:19:05,397 INFO L87 Difference]: Start difference. First operand 7620 states and 13099 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:05,890 INFO L93 Difference]: Finished difference Result 15105 states and 26419 transitions. [2025-03-03 14:19:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:19:05,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2025-03-03 14:19:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:05,942 INFO L225 Difference]: With dead ends: 15105 [2025-03-03 14:19:05,943 INFO L226 Difference]: Without dead ends: 7768 [2025-03-03 14:19:05,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:05,977 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 225 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4007 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:05,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4007 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:19:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7768 states. [2025-03-03 14:19:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7768 to 7644. [2025-03-03 14:19:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7644 states, 5709 states have (on average 1.627780697144859) internal successors, (9293), 6101 states have internal predecessors, (9293), 1584 states have call successors, (1584), 269 states have call predecessors, (1584), 350 states have return successors, (2135), 1564 states have call predecessors, (2135), 1579 states have call successors, (2135) [2025-03-03 14:19:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7644 states to 7644 states and 13012 transitions. [2025-03-03 14:19:06,377 INFO L78 Accepts]: Start accepts. Automaton has 7644 states and 13012 transitions. Word has length 105 [2025-03-03 14:19:06,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:06,377 INFO L471 AbstractCegarLoop]: Abstraction has 7644 states and 13012 transitions. [2025-03-03 14:19:06,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:19:06,377 INFO L276 IsEmpty]: Start isEmpty. Operand 7644 states and 13012 transitions. [2025-03-03 14:19:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:19:06,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:06,379 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:06,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:19:06,379 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:06,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -120006380, now seen corresponding path program 1 times [2025-03-03 14:19:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518346946] [2025-03-03 14:19:06,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:06,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:06,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:19:06,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:19:06,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:06,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:19:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:06,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518346946] [2025-03-03 14:19:06,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518346946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:06,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:06,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:19:06,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988990290] [2025-03-03 14:19:06,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:06,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:19:06,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:06,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:19:06,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:19:06,535 INFO L87 Difference]: Start difference. First operand 7644 states and 13012 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:19:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,214 INFO L93 Difference]: Finished difference Result 14518 states and 24752 transitions. [2025-03-03 14:19:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:19:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 110 [2025-03-03 14:19:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,268 INFO L225 Difference]: With dead ends: 14518 [2025-03-03 14:19:08,268 INFO L226 Difference]: Without dead ends: 8192 [2025-03-03 14:19:08,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:19:08,296 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 2008 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 3024 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2077 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 3024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:08,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2077 Valid, 1488 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 3024 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:19:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8192 states. [2025-03-03 14:19:08,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8192 to 7875. [2025-03-03 14:19:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7875 states, 5882 states have (on average 1.6164569874192452) internal successors, (9508), 6292 states have internal predecessors, (9508), 1601 states have call successors, (1601), 295 states have call predecessors, (1601), 391 states have return successors, (2224), 1578 states have call predecessors, (2224), 1596 states have call successors, (2224) [2025-03-03 14:19:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7875 states to 7875 states and 13333 transitions. [2025-03-03 14:19:08,656 INFO L78 Accepts]: Start accepts. Automaton has 7875 states and 13333 transitions. Word has length 110 [2025-03-03 14:19:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:08,656 INFO L471 AbstractCegarLoop]: Abstraction has 7875 states and 13333 transitions. [2025-03-03 14:19:08,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:19:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7875 states and 13333 transitions. [2025-03-03 14:19:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:19:08,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:08,659 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:08,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:19:08,659 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1210247071, now seen corresponding path program 1 times [2025-03-03 14:19:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944871461] [2025-03-03 14:19:08,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:19:08,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:19:08,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:08,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:08,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944871461] [2025-03-03 14:19:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944871461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:08,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:08,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858046161] [2025-03-03 14:19:08,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:08,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:08,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:08,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:08,826 INFO L87 Difference]: Start difference. First operand 7875 states and 13333 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:11,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:11,032 INFO L93 Difference]: Finished difference Result 16532 states and 27730 transitions. [2025-03-03 14:19:11,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:19:11,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 117 [2025-03-03 14:19:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:11,085 INFO L225 Difference]: With dead ends: 16532 [2025-03-03 14:19:11,085 INFO L226 Difference]: Without dead ends: 9794 [2025-03-03 14:19:11,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:19:11,113 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2836 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 5261 mSolverCounterSat, 615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 5876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 615 IncrementalHoareTripleChecker+Valid, 5261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:11,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 2181 Invalid, 5876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [615 Valid, 5261 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:19:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9794 states. [2025-03-03 14:19:11,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9794 to 9349. [2025-03-03 14:19:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9349 states, 7048 states have (on average 1.5929341657207718) internal successors, (11227), 7517 states have internal predecessors, (11227), 1784 states have call successors, (1784), 382 states have call predecessors, (1784), 516 states have return successors, (2497), 1740 states have call predecessors, (2497), 1779 states have call successors, (2497) [2025-03-03 14:19:11,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9349 states to 9349 states and 15508 transitions. [2025-03-03 14:19:11,615 INFO L78 Accepts]: Start accepts. Automaton has 9349 states and 15508 transitions. Word has length 117 [2025-03-03 14:19:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:11,616 INFO L471 AbstractCegarLoop]: Abstraction has 9349 states and 15508 transitions. [2025-03-03 14:19:11,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 9349 states and 15508 transitions. [2025-03-03 14:19:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:19:11,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:11,619 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:11,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:19:11,620 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:11,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1901372928, now seen corresponding path program 1 times [2025-03-03 14:19:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:11,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883678706] [2025-03-03 14:19:11,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:11,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:19:11,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:19:11,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:11,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:11,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883678706] [2025-03-03 14:19:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883678706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:11,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970622248] [2025-03-03 14:19:11,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:11,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:11,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:11,768 INFO L87 Difference]: Start difference. First operand 9349 states and 15508 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:12,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:12,296 INFO L93 Difference]: Finished difference Result 21937 states and 36489 transitions. [2025-03-03 14:19:12,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:12,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2025-03-03 14:19:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:12,379 INFO L225 Difference]: With dead ends: 21937 [2025-03-03 14:19:12,379 INFO L226 Difference]: Without dead ends: 13906 [2025-03-03 14:19:12,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:12,413 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 744 mSDsluCounter, 3449 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 4785 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:12,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 4785 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13906 states. [2025-03-03 14:19:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13906 to 12052. [2025-03-03 14:19:12,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12052 states, 9066 states have (on average 1.6062210456651225) internal successors, (14562), 9668 states have internal predecessors, (14562), 2355 states have call successors, (2355), 471 states have call predecessors, (2355), 630 states have return successors, (3236), 2320 states have call predecessors, (3236), 2350 states have call successors, (3236) [2025-03-03 14:19:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12052 states to 12052 states and 20153 transitions. [2025-03-03 14:19:12,937 INFO L78 Accepts]: Start accepts. Automaton has 12052 states and 20153 transitions. Word has length 117 [2025-03-03 14:19:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:12,937 INFO L471 AbstractCegarLoop]: Abstraction has 12052 states and 20153 transitions. [2025-03-03 14:19:12,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:19:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 12052 states and 20153 transitions. [2025-03-03 14:19:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:19:12,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:12,939 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, 1, 1, 1, 1] [2025-03-03 14:19:12,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:19:12,940 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:12,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 165130169, now seen corresponding path program 1 times [2025-03-03 14:19:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:12,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884572751] [2025-03-03 14:19:12,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:12,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:19:12,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:19:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:12,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:13,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:13,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884572751] [2025-03-03 14:19:13,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884572751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:13,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:13,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135791500] [2025-03-03 14:19:13,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:13,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:13,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:13,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:13,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:13,074 INFO L87 Difference]: Start difference. First operand 12052 states and 20153 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:19:16,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:16,113 INFO L93 Difference]: Finished difference Result 42010 states and 72869 transitions. [2025-03-03 14:19:16,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:19:16,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2025-03-03 14:19:16,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:16,331 INFO L225 Difference]: With dead ends: 42010 [2025-03-03 14:19:16,331 INFO L226 Difference]: Without dead ends: 30003 [2025-03-03 14:19:16,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:16,399 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 3913 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 4459 mSolverCounterSat, 1176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 5635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1176 IncrementalHoareTripleChecker+Valid, 4459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:16,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3949 Valid, 2606 Invalid, 5635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1176 Valid, 4459 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:19:16,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30003 states. [2025-03-03 14:19:17,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30003 to 29802. [2025-03-03 14:19:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29802 states, 21062 states have (on average 1.5805716456177001) internal successors, (33290), 22865 states have internal predecessors, (33290), 7395 states have call successors, (7395), 937 states have call predecessors, (7395), 1344 states have return successors, (10462), 7375 states have call predecessors, (10462), 7390 states have call successors, (10462) [2025-03-03 14:19:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29802 states to 29802 states and 51147 transitions. [2025-03-03 14:19:18,254 INFO L78 Accepts]: Start accepts. Automaton has 29802 states and 51147 transitions. Word has length 115 [2025-03-03 14:19:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:18,255 INFO L471 AbstractCegarLoop]: Abstraction has 29802 states and 51147 transitions. [2025-03-03 14:19:18,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:19:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 29802 states and 51147 transitions. [2025-03-03 14:19:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:19:18,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:18,257 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, 1, 1, 1, 1, 1] [2025-03-03 14:19:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:19:18,258 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:18,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:18,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1542180668, now seen corresponding path program 1 times [2025-03-03 14:19:18,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:18,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000643956] [2025-03-03 14:19:18,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:18,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:19:18,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:19:18,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:18,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:18,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:18,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000643956] [2025-03-03 14:19:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000643956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:18,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353925233] [2025-03-03 14:19:18,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:18,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:18,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:18,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:18,410 INFO L87 Difference]: Start difference. First operand 29802 states and 51147 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:19:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:25,833 INFO L93 Difference]: Finished difference Result 110919 states and 198606 transitions. [2025-03-03 14:19:25,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:19:25,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2025-03-03 14:19:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:26,734 INFO L225 Difference]: With dead ends: 110919 [2025-03-03 14:19:26,735 INFO L226 Difference]: Without dead ends: 81162 [2025-03-03 14:19:26,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:26,887 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 3907 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 4450 mSolverCounterSat, 1165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3943 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 5615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1165 IncrementalHoareTripleChecker+Valid, 4450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:26,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3943 Valid, 2579 Invalid, 5615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1165 Valid, 4450 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:19:26,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81162 states. [2025-03-03 14:19:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81162 to 80777. [2025-03-03 14:19:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80777 states, 53174 states have (on average 1.5544062887877534) internal successors, (82654), 58807 states have internal predecessors, (82654), 24678 states have call successors, (24678), 1869 states have call predecessors, (24678), 2924 states have return successors, (36496), 24854 states have call predecessors, (36496), 24673 states have call successors, (36496) [2025-03-03 14:19:32,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80777 states to 80777 states and 143828 transitions. [2025-03-03 14:19:32,423 INFO L78 Accepts]: Start accepts. Automaton has 80777 states and 143828 transitions. Word has length 116 [2025-03-03 14:19:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:32,423 INFO L471 AbstractCegarLoop]: Abstraction has 80777 states and 143828 transitions. [2025-03-03 14:19:32,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:19:32,424 INFO L276 IsEmpty]: Start isEmpty. Operand 80777 states and 143828 transitions. [2025-03-03 14:19:32,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:19:32,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:32,426 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:32,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:19:32,426 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:32,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:32,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2057629622, now seen corresponding path program 1 times [2025-03-03 14:19:32,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:32,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811390981] [2025-03-03 14:19:32,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:32,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:32,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:19:32,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:19:32,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:32,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:32,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:32,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811390981] [2025-03-03 14:19:32,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811390981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:32,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:32,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74014366] [2025-03-03 14:19:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:32,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:32,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:32,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:32,562 INFO L87 Difference]: Start difference. First operand 80777 states and 143828 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12)