./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_product29.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 bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:28:49,971 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:28:50,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:28:50,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:28:50,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:28:50,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:28:50,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:28:50,049 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:28:50,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:28:50,050 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:28:50,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:28:50,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:28:50,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:28:50,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:50,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:28:50,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:28:50,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:28:50,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:28:50,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:28:50,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:28:50,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:28:50,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:28:50,052 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 -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2025-03-08 05:28:50,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:28:50,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:28:50,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:28:50,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:28:50,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:28:50,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2025-03-08 05:28:51,431 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb63d4dc4/c75c9e2462da4c36aa09d9d5d337fe75/FLAG478d1a527 [2025-03-08 05:28:51,733 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:28:51,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2025-03-08 05:28:51,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb63d4dc4/c75c9e2462da4c36aa09d9d5d337fe75/FLAG478d1a527 [2025-03-08 05:28:51,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb63d4dc4/c75c9e2462da4c36aa09d9d5d337fe75 [2025-03-08 05:28:51,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:28:51,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:28:51,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:51,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:28:51,996 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:28:51,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:51" (1/1) ... [2025-03-08 05:28:51,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58508e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:51, skipping insertion in model container [2025-03-08 05:28:51,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:51" (1/1) ... [2025-03-08 05:28:52,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:28:52,155 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_product29.cil.c[1700,1713] [2025-03-08 05:28:52,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:52,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:28:52,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2025-03-08 05:28:52,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2025-03-08 05:28:52,488 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_product29.cil.c[1700,1713] [2025-03-08 05:28:52,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:52,587 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:28:52,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52 WrapperNode [2025-03-08 05:28:52,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:52,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:52,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:28:52,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:28:52,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,641 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 860 [2025-03-08 05:28:52,642 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:52,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:28:52,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:28:52,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:28:52,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,657 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,689 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-08 05:28:52,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,714 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:28:52,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:28:52,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:28:52,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:28:52,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (1/1) ... [2025-03-08 05:28:52,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:52,770 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-08 05:28:52,773 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-08 05:28:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:28:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:28:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:28:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:28:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:28:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:28:52,792 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:28:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:28:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:28:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:28:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:28:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:28:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-08 05:28:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:28:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:28:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:28:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:28:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:28:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:28:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:28:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:28:52,795 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:28:52,795 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:28:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:28:52,796 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:28:52,796 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:28:52,797 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:28:52,797 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:28:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:28:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:28:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:28:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:28:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:28:52,798 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:28:52,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:28:52,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:28:52,948 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:28:52,993 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3404: #res := ~retValue_acc~27; [2025-03-08 05:28:53,015 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3326: #res := ~retValue_acc~25; [2025-03-08 05:28:53,018 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1829: #res := ~retValue_acc~10; [2025-03-08 05:28:53,026 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006: #res := ~retValue_acc~11; [2025-03-08 05:28:53,209 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2616-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~20#1; [2025-03-08 05:28:53,209 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2582: #res#1 := ~retValue_acc~19#1; [2025-03-08 05:28:53,275 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2714: #res := ~retValue_acc~23; [2025-03-08 05:28:53,287 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3365: #res := ~retValue_acc~26; [2025-03-08 05:28:53,317 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2098: #res := ~retValue_acc~15; [2025-03-08 05:28:53,419 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~18; [2025-03-08 05:28:53,427 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2049: #res := ~retValue_acc~13; [2025-03-08 05:28:53,570 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2672-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~21#1; [2025-03-08 05:28:53,571 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2700-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-03-08 05:28:53,571 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2015-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-03-08 05:28:53,633 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2178-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-08 05:28:53,633 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-08 05:28:53,677 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: #res := ~retValue_acc~1; [2025-03-08 05:28:53,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1260-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-08 05:28:53,739 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1387-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-08 05:28:53,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: #res := ~retValue_acc~0; [2025-03-08 05:28:53,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L900: #res := ~retValue_acc~2; [2025-03-08 05:28:53,879 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2025-03-08 05:28:53,879 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:28:53,898 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:28:53,903 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:28:53,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:53 BoogieIcfgContainer [2025-03-08 05:28:53,903 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:28:53,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:28:53,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:28:53,909 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:28:53,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:51" (1/3) ... [2025-03-08 05:28:53,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b41cee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:53, skipping insertion in model container [2025-03-08 05:28:53,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:52" (2/3) ... [2025-03-08 05:28:53,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b41cee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:53, skipping insertion in model container [2025-03-08 05:28:53,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:53" (3/3) ... [2025-03-08 05:28:53,910 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2025-03-08 05:28:53,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:28:53,926 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product29.cil.c that has 25 procedures, 561 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:28:53,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:28:53,985 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;@774de1da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:28:53,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:28:53,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 561 states, 443 states have (on average 1.6997742663656885) internal successors, (753), 464 states have internal predecessors, (753), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 05:28:54,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:28:54,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,018 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-08 05:28:54,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,025 INFO L85 PathProgramCache]: Analyzing trace with hash 87409710, now seen corresponding path program 1 times [2025-03-08 05:28:54,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448057730] [2025-03-08 05:28:54,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:28:54,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:28:54,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,488 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-08 05:28:54,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448057730] [2025-03-08 05:28:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448057730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777893820] [2025-03-08 05:28:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:54,515 INFO L87 Difference]: Start difference. First operand has 561 states, 443 states have (on average 1.6997742663656885) internal successors, (753), 464 states have internal predecessors, (753), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:54,620 INFO L93 Difference]: Finished difference Result 1102 states and 1849 transitions. [2025-03-08 05:28:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:54,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-08 05:28:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,639 INFO L225 Difference]: With dead ends: 1102 [2025-03-08 05:28:54,640 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 05:28:54,647 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-08 05:28:54,649 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 5 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2747 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-08 05:28:54,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2747 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 05:28:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 05:28:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 437 states have (on average 1.6979405034324944) internal successors, (742), 456 states have internal predecessors, (742), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 921 transitions. [2025-03-08 05:28:54,731 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 921 transitions. Word has length 90 [2025-03-08 05:28:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:54,732 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 921 transitions. [2025-03-08 05:28:54,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 921 transitions. [2025-03-08 05:28:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 05:28:54,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:54,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:28:54,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1037899625, now seen corresponding path program 1 times [2025-03-08 05:28:54,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546454624] [2025-03-08 05:28:54,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 05:28:54,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 05:28:54,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,956 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-08 05:28:54,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546454624] [2025-03-08 05:28:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546454624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274374284] [2025-03-08 05:28:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:54,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:54,962 INFO L87 Difference]: Start difference. First operand 553 states and 921 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,018 INFO L93 Difference]: Finished difference Result 1088 states and 1819 transitions. [2025-03-08 05:28:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2025-03-08 05:28:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,024 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:28:55,025 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 05:28:55,027 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-08 05:28:55,028 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 4 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2726 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-08 05:28:55,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 05:28:55,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 05:28:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 437 states have (on average 1.6956521739130435) internal successors, (741), 456 states have internal predecessors, (741), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 920 transitions. [2025-03-08 05:28:55,055 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 920 transitions. Word has length 92 [2025-03-08 05:28:55,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,055 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 920 transitions. [2025-03-08 05:28:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 920 transitions. [2025-03-08 05:28:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-08 05:28:55,059 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,059 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-08 05:28:55,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:28:55,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2038843977, now seen corresponding path program 1 times [2025-03-08 05:28:55,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984126695] [2025-03-08 05:28:55,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-08 05:28:55,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-08 05:28:55,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,208 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-08 05:28:55,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984126695] [2025-03-08 05:28:55,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984126695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102026871] [2025-03-08 05:28:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:55,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:55,210 INFO L87 Difference]: Start difference. First operand 553 states and 920 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,256 INFO L93 Difference]: Finished difference Result 1088 states and 1818 transitions. [2025-03-08 05:28:55,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2025-03-08 05:28:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,264 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:28:55,265 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 05:28:55,268 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-08 05:28:55,269 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 3 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2726 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-08 05:28:55,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2726 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 05:28:55,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 05:28:55,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 437 states have (on average 1.6933638443935928) internal successors, (740), 456 states have internal predecessors, (740), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2025-03-08 05:28:55,288 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 93 [2025-03-08 05:28:55,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,288 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2025-03-08 05:28:55,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2025-03-08 05:28:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:28:55,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,295 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] [2025-03-08 05:28:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:28:55,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash -103729830, now seen corresponding path program 1 times [2025-03-08 05:28:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15686812] [2025-03-08 05:28:55,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:28:55,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:28:55,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,428 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-08 05:28:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15686812] [2025-03-08 05:28:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15686812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:55,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616247321] [2025-03-08 05:28:55,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:55,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:55,429 INFO L87 Difference]: Start difference. First operand 553 states and 919 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,477 INFO L93 Difference]: Finished difference Result 1088 states and 1817 transitions. [2025-03-08 05:28:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:55,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2025-03-08 05:28:55,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,483 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:28:55,483 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 05:28:55,485 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-08 05:28:55,486 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 2 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2726 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-08 05:28:55,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2726 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 05:28:55,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 05:28:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 437 states have (on average 1.6910755148741419) internal successors, (739), 456 states have internal predecessors, (739), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:55,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 918 transitions. [2025-03-08 05:28:55,511 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 918 transitions. Word has length 94 [2025-03-08 05:28:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,511 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 918 transitions. [2025-03-08 05:28:55,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 918 transitions. [2025-03-08 05:28:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:28:55,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,516 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] [2025-03-08 05:28:55,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:28:55,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash -836386068, now seen corresponding path program 1 times [2025-03-08 05:28:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185895859] [2025-03-08 05:28:55,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:28:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:28:55,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,645 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-08 05:28:55,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185895859] [2025-03-08 05:28:55,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185895859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:55,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414802895] [2025-03-08 05:28:55,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:55,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:55,647 INFO L87 Difference]: Start difference. First operand 553 states and 918 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,679 INFO L93 Difference]: Finished difference Result 1088 states and 1816 transitions. [2025-03-08 05:28:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:55,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2025-03-08 05:28:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,683 INFO L225 Difference]: With dead ends: 1088 [2025-03-08 05:28:55,684 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 05:28:55,686 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-08 05:28:55,686 INFO L435 NwaCegarLoop]: 910 mSDtfsCounter, 1 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2726 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-08 05:28:55,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2726 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 05:28:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2025-03-08 05:28:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 437 states have (on average 1.688787185354691) internal successors, (738), 456 states have internal predecessors, (738), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 917 transitions. [2025-03-08 05:28:55,703 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 917 transitions. Word has length 95 [2025-03-08 05:28:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,703 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 917 transitions. [2025-03-08 05:28:55,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 917 transitions. [2025-03-08 05:28:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:28:55,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,705 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] [2025-03-08 05:28:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:28:55,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash -811270627, now seen corresponding path program 1 times [2025-03-08 05:28:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754181937] [2025-03-08 05:28:55,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:28:55,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:28:55,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,937 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-08 05:28:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754181937] [2025-03-08 05:28:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754181937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:28:55,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829723449] [2025-03-08 05:28:55,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:28:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:28:55,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:28:55,939 INFO L87 Difference]: Start difference. First operand 553 states and 917 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,031 INFO L93 Difference]: Finished difference Result 1054 states and 1748 transitions. [2025-03-08 05:28:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2025-03-08 05:28:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,036 INFO L225 Difference]: With dead ends: 1054 [2025-03-08 05:28:56,036 INFO L226 Difference]: Without dead ends: 568 [2025-03-08 05:28:56,038 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-08 05:28:56,039 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 91 mSDsluCounter, 6252 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 7157 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:56,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 7157 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:56,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-08 05:28:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 566. [2025-03-08 05:28:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 447 states have (on average 1.6845637583892616) internal successors, (753), 468 states have internal predecessors, (753), 93 states have call successors, (93), 24 states have call predecessors, (93), 25 states have return successors, (90), 86 states have call predecessors, (90), 88 states have call successors, (90) [2025-03-08 05:28:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 936 transitions. [2025-03-08 05:28:56,097 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 936 transitions. Word has length 96 [2025-03-08 05:28:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,097 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 936 transitions. [2025-03-08 05:28:56,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 936 transitions. [2025-03-08 05:28:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 05:28:56,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,100 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] [2025-03-08 05:28:56,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:28:56,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash -691150754, now seen corresponding path program 1 times [2025-03-08 05:28:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197066247] [2025-03-08 05:28:56,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 05:28:56,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 05:28:56,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,188 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-08 05:28:56,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197066247] [2025-03-08 05:28:56,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197066247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727325411] [2025-03-08 05:28:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:56,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:56,191 INFO L87 Difference]: Start difference. First operand 566 states and 936 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:56,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,231 INFO L93 Difference]: Finished difference Result 1106 states and 1842 transitions. [2025-03-08 05:28:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:56,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-03-08 05:28:56,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,236 INFO L225 Difference]: With dead ends: 1106 [2025-03-08 05:28:56,236 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 05:28:56,237 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-08 05:28:56,238 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 0 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2728 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-08 05:28:56,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2728 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 05:28:56,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-03-08 05:28:56,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.679814385150812) internal successors, (724), 450 states have internal predecessors, (724), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 903 transitions. [2025-03-08 05:28:56,255 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 903 transitions. Word has length 96 [2025-03-08 05:28:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,256 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 903 transitions. [2025-03-08 05:28:56,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:56,256 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 903 transitions. [2025-03-08 05:28:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 05:28:56,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,259 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] [2025-03-08 05:28:56,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:28:56,259 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,260 INFO L85 PathProgramCache]: Analyzing trace with hash -198959994, now seen corresponding path program 1 times [2025-03-08 05:28:56,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235847518] [2025-03-08 05:28:56,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 05:28:56,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 05:28:56,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,388 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-08 05:28:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235847518] [2025-03-08 05:28:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235847518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936195645] [2025-03-08 05:28:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:56,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:56,389 INFO L87 Difference]: Start difference. First operand 547 states and 903 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:56,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,547 INFO L93 Difference]: Finished difference Result 1051 states and 1740 transitions. [2025-03-08 05:28:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:56,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 97 [2025-03-08 05:28:56,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,551 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:28:56,552 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 05:28:56,554 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-08 05:28:56,554 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 55 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:56,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4271 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:56,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 05:28:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 547. [2025-03-08 05:28:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.6705336426914152) internal successors, (720), 450 states have internal predecessors, (720), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 899 transitions. [2025-03-08 05:28:56,571 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 899 transitions. Word has length 97 [2025-03-08 05:28:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,571 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 899 transitions. [2025-03-08 05:28:56,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 899 transitions. [2025-03-08 05:28:56,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 05:28:56,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,574 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-08 05:28:56,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:28:56,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 64218566, now seen corresponding path program 1 times [2025-03-08 05:28:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217881444] [2025-03-08 05:28:56,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 05:28:56,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 05:28:56,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:56,693 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-08 05:28:56,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:56,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217881444] [2025-03-08 05:28:56,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217881444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:56,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:56,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:56,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050186380] [2025-03-08 05:28:56,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:56,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:56,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:56,695 INFO L87 Difference]: Start difference. First operand 547 states and 899 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:56,856 INFO L93 Difference]: Finished difference Result 1051 states and 1736 transitions. [2025-03-08 05:28:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-08 05:28:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:56,860 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:28:56,860 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 05:28:56,862 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-08 05:28:56,862 INFO L435 NwaCegarLoop]: 860 mSDtfsCounter, 54 mSDsluCounter, 3411 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4271 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-08 05:28:56,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4271 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:56,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 05:28:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 547. [2025-03-08 05:28:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.6612529002320187) internal successors, (716), 450 states have internal predecessors, (716), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:56,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 895 transitions. [2025-03-08 05:28:56,878 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 895 transitions. Word has length 98 [2025-03-08 05:28:56,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:56,878 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 895 transitions. [2025-03-08 05:28:56,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 895 transitions. [2025-03-08 05:28:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:28:56,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:56,881 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] [2025-03-08 05:28:56,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:28:56,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:56,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash -565171357, now seen corresponding path program 1 times [2025-03-08 05:28:56,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:56,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673988148] [2025-03-08 05:28:56,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:56,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:56,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:28:56,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:28:56,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:56,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,006 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-08 05:28:57,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673988148] [2025-03-08 05:28:57,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673988148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:57,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336732233] [2025-03-08 05:28:57,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:57,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:57,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:57,007 INFO L87 Difference]: Start difference. First operand 547 states and 895 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,143 INFO L93 Difference]: Finished difference Result 1051 states and 1732 transitions. [2025-03-08 05:28:57,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-08 05:28:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,148 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 05:28:57,148 INFO L226 Difference]: Without dead ends: 556 [2025-03-08 05:28:57,150 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-08 05:28:57,151 INFO L435 NwaCegarLoop]: 859 mSDtfsCounter, 53 mSDsluCounter, 3394 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4253 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-08 05:28:57,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4253 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-08 05:28:57,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 547. [2025-03-08 05:28:57,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 431 states have (on average 1.6519721577726219) internal successors, (712), 450 states have internal predecessors, (712), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 891 transitions. [2025-03-08 05:28:57,169 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 891 transitions. Word has length 99 [2025-03-08 05:28:57,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,169 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 891 transitions. [2025-03-08 05:28:57,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 891 transitions. [2025-03-08 05:28:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 05:28:57,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,173 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] [2025-03-08 05:28:57,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:28:57,173 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash 891709780, now seen corresponding path program 1 times [2025-03-08 05:28:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666493480] [2025-03-08 05:28:57,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 05:28:57,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 05:28:57,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,308 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-08 05:28:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666493480] [2025-03-08 05:28:57,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666493480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034446769] [2025-03-08 05:28:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:57,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:57,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:57,309 INFO L87 Difference]: Start difference. First operand 547 states and 891 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,382 INFO L93 Difference]: Finished difference Result 1042 states and 1714 transitions. [2025-03-08 05:28:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2025-03-08 05:28:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,388 INFO L225 Difference]: With dead ends: 1042 [2025-03-08 05:28:57,388 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 05:28:57,390 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-08 05:28:57,390 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 84 mSDsluCounter, 4327 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5207 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-08 05:28:57,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5207 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:57,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 05:28:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-08 05:28:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 410 states have (on average 1.6536585365853658) internal successors, (678), 429 states have internal predecessors, (678), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 857 transitions. [2025-03-08 05:28:57,405 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 857 transitions. Word has length 99 [2025-03-08 05:28:57,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,405 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 857 transitions. [2025-03-08 05:28:57,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 857 transitions. [2025-03-08 05:28:57,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 05:28:57,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,409 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] [2025-03-08 05:28:57,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:28:57,409 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1200586819, now seen corresponding path program 1 times [2025-03-08 05:28:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953626798] [2025-03-08 05:28:57,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 05:28:57,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 05:28:57,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,523 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-08 05:28:57,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953626798] [2025-03-08 05:28:57,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953626798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:57,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078936340] [2025-03-08 05:28:57,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:57,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:57,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:57,524 INFO L87 Difference]: Start difference. First operand 526 states and 857 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,585 INFO L93 Difference]: Finished difference Result 1021 states and 1680 transitions. [2025-03-08 05:28:57,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:57,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 100 [2025-03-08 05:28:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,589 INFO L225 Difference]: With dead ends: 1021 [2025-03-08 05:28:57,589 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 05:28:57,591 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-08 05:28:57,592 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 17 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4191 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-08 05:28:57,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4191 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 05:28:57,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-08 05:28:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 410 states have (on average 1.6512195121951219) internal successors, (677), 429 states have internal predecessors, (677), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 856 transitions. [2025-03-08 05:28:57,607 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 856 transitions. Word has length 100 [2025-03-08 05:28:57,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,607 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 856 transitions. [2025-03-08 05:28:57,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:57,607 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 856 transitions. [2025-03-08 05:28:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 05:28:57,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,610 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] [2025-03-08 05:28:57,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:28:57,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash -93475264, now seen corresponding path program 1 times [2025-03-08 05:28:57,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431226665] [2025-03-08 05:28:57,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 05:28:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 05:28:57,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:57,720 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-08 05:28:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431226665] [2025-03-08 05:28:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431226665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:57,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:57,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374170652] [2025-03-08 05:28:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:57,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:57,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:57,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:57,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:57,722 INFO L87 Difference]: Start difference. First operand 526 states and 856 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:57,779 INFO L93 Difference]: Finished difference Result 1021 states and 1679 transitions. [2025-03-08 05:28:57,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:57,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2025-03-08 05:28:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:57,784 INFO L225 Difference]: With dead ends: 1021 [2025-03-08 05:28:57,784 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 05:28:57,786 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-08 05:28:57,787 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 16 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4191 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-08 05:28:57,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4191 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:57,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 05:28:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-08 05:28:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 410 states have (on average 1.648780487804878) internal successors, (676), 429 states have internal predecessors, (676), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 855 transitions. [2025-03-08 05:28:57,803 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 855 transitions. Word has length 101 [2025-03-08 05:28:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:57,803 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 855 transitions. [2025-03-08 05:28:57,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:28:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 855 transitions. [2025-03-08 05:28:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:28:57,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:57,806 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] [2025-03-08 05:28:57,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:28:57,806 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:57,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1752684864, now seen corresponding path program 1 times [2025-03-08 05:28:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:57,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55185969] [2025-03-08 05:28:57,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:57,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:28:57,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:28:57,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:57,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,006 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-08 05:28:58,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55185969] [2025-03-08 05:28:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55185969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:28:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783054005] [2025-03-08 05:28:58,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:28:58,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:28:58,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:28:58,008 INFO L87 Difference]: Start difference. First operand 526 states and 855 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:58,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:58,093 INFO L93 Difference]: Finished difference Result 1015 states and 1667 transitions. [2025-03-08 05:28:58,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:28:58,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 102 [2025-03-08 05:28:58,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:58,098 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:58,098 INFO L226 Difference]: Without dead ends: 526 [2025-03-08 05:28:58,100 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-08 05:28:58,100 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 6 mSDsluCounter, 6690 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7529 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-08 05:28:58,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7529 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:58,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-08 05:28:58,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-08 05:28:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 410 states have (on average 1.646341463414634) internal successors, (675), 429 states have internal predecessors, (675), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-08 05:28:58,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 854 transitions. [2025-03-08 05:28:58,115 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 854 transitions. Word has length 102 [2025-03-08 05:28:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:58,115 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 854 transitions. [2025-03-08 05:28:58,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 05:28:58,116 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 854 transitions. [2025-03-08 05:28:58,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 05:28:58,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:58,118 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] [2025-03-08 05:28:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:28:58,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:58,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:58,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1963785965, now seen corresponding path program 1 times [2025-03-08 05:28:58,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:58,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366924297] [2025-03-08 05:28:58,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:58,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-08 05:28:58,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 05:28:58,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:58,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:58,325 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-08 05:28:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366924297] [2025-03-08 05:28:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366924297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:58,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:28:58,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869392579] [2025-03-08 05:28:58,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:58,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:28:58,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:58,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:28:58,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:58,327 INFO L87 Difference]: Start difference. First operand 526 states and 854 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:28:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:59,892 INFO L93 Difference]: Finished difference Result 1011 states and 1679 transitions. [2025-03-08 05:28:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:28:59,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 103 [2025-03-08 05:28:59,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:59,899 INFO L225 Difference]: With dead ends: 1011 [2025-03-08 05:28:59,899 INFO L226 Difference]: Without dead ends: 530 [2025-03-08 05:28:59,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:59,904 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1315 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:59,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1315 Valid, 1514 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 05:28:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-08 05:28:59,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-08 05:28:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 413 states have (on average 1.6416464891041163) internal successors, (678), 432 states have internal predecessors, (678), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (103), 86 states have call predecessors, (103), 87 states have call successors, (103) [2025-03-08 05:28:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 873 transitions. [2025-03-08 05:28:59,938 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 873 transitions. Word has length 103 [2025-03-08 05:28:59,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:59,939 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 873 transitions. [2025-03-08 05:28:59,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:28:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 873 transitions. [2025-03-08 05:28:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 05:28:59,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:59,943 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] [2025-03-08 05:28:59,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:28:59,943 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:59,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash 2109902543, now seen corresponding path program 1 times [2025-03-08 05:28:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:59,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014865923] [2025-03-08 05:28:59,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:59,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 05:28:59,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 05:28:59,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:59,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:00,144 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-08 05:29:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:00,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014865923] [2025-03-08 05:29:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014865923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:00,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:00,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:29:00,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423530060] [2025-03-08 05:29:00,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:00,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:29:00,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:00,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:29:00,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:00,148 INFO L87 Difference]: Start difference. First operand 530 states and 873 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:29:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:03,282 INFO L93 Difference]: Finished difference Result 1885 states and 3212 transitions. [2025-03-08 05:29:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:29:03,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2025-03-08 05:29:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:03,293 INFO L225 Difference]: With dead ends: 1885 [2025-03-08 05:29:03,293 INFO L226 Difference]: Without dead ends: 1400 [2025-03-08 05:29:03,296 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-08 05:29:03,297 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 2415 mSDsluCounter, 1737 mSDsCounter, 0 mSdLazyCounter, 4981 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2486 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 5583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 4981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:03,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2486 Valid, 2280 Invalid, 5583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 4981 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 05:29:03,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-03-08 05:29:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1340. [2025-03-08 05:29:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1040 states have (on average 1.6509615384615384) internal successors, (1717), 1088 states have internal predecessors, (1717), 236 states have call successors, (236), 63 states have call predecessors, (236), 63 states have return successors, (257), 225 states have call predecessors, (257), 231 states have call successors, (257) [2025-03-08 05:29:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2210 transitions. [2025-03-08 05:29:03,364 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2210 transitions. Word has length 104 [2025-03-08 05:29:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:03,364 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 2210 transitions. [2025-03-08 05:29:03,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-08 05:29:03,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2210 transitions. [2025-03-08 05:29:03,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 05:29:03,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:03,367 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] [2025-03-08 05:29:03,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:29:03,367 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:03,368 INFO L85 PathProgramCache]: Analyzing trace with hash -705036498, now seen corresponding path program 1 times [2025-03-08 05:29:03,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:03,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6264046] [2025-03-08 05:29:03,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:03,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:03,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 05:29:03,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 05:29:03,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:03,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6264046] [2025-03-08 05:29:03,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6264046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248984911] [2025-03-08 05:29:03,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:03,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:03,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:03,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:03,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:03,489 INFO L87 Difference]: Start difference. First operand 1340 states and 2210 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:05,854 INFO L93 Difference]: Finished difference Result 4691 states and 7962 transitions. [2025-03-08 05:29:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:05,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2025-03-08 05:29:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:05,879 INFO L225 Difference]: With dead ends: 4691 [2025-03-08 05:29:05,880 INFO L226 Difference]: Without dead ends: 3397 [2025-03-08 05:29:05,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:05,887 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 3368 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 988 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3402 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 4418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 988 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:05,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3402 Valid, 1997 Invalid, 4418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [988 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 05:29:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3397 states. [2025-03-08 05:29:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3397 to 3072. [2025-03-08 05:29:06,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 2269 states have (on average 1.636403702071397) internal successors, (3713), 2415 states have internal predecessors, (3713), 670 states have call successors, (670), 121 states have call predecessors, (670), 132 states have return successors, (771), 657 states have call predecessors, (771), 665 states have call successors, (771) [2025-03-08 05:29:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 5154 transitions. [2025-03-08 05:29:06,100 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 5154 transitions. Word has length 106 [2025-03-08 05:29:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 3072 states and 5154 transitions. [2025-03-08 05:29:06,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 5154 transitions. [2025-03-08 05:29:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:29:06,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:06,105 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] [2025-03-08 05:29:06,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:06,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:06,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash 255958677, now seen corresponding path program 1 times [2025-03-08 05:29:06,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200879343] [2025-03-08 05:29:06,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:06,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:29:06,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:29:06,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:06,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:06,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:06,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200879343] [2025-03-08 05:29:06,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200879343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864759288] [2025-03-08 05:29:06,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:06,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:06,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:06,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:06,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:06,249 INFO L87 Difference]: Start difference. First operand 3072 states and 5154 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:08,636 INFO L93 Difference]: Finished difference Result 11629 states and 20137 transitions. [2025-03-08 05:29:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:08,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-03-08 05:29:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:08,680 INFO L225 Difference]: With dead ends: 11629 [2025-03-08 05:29:08,681 INFO L226 Difference]: Without dead ends: 8604 [2025-03-08 05:29:08,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:08,694 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 3381 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 3399 mSolverCounterSat, 1008 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3416 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 4407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1008 IncrementalHoareTripleChecker+Valid, 3399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:08,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3416 Valid, 2010 Invalid, 4407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1008 Valid, 3399 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:29:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8604 states. [2025-03-08 05:29:09,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8604 to 7687. [2025-03-08 05:29:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7687 states, 5354 states have (on average 1.61524094135226) internal successors, (8648), 5786 states have internal predecessors, (8648), 2047 states have call successors, (2047), 237 states have call predecessors, (2047), 285 states have return successors, (2483), 2042 states have call predecessors, (2483), 2042 states have call successors, (2483) [2025-03-08 05:29:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7687 states to 7687 states and 13178 transitions. [2025-03-08 05:29:09,148 INFO L78 Accepts]: Start accepts. Automaton has 7687 states and 13178 transitions. Word has length 107 [2025-03-08 05:29:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:09,148 INFO L471 AbstractCegarLoop]: Abstraction has 7687 states and 13178 transitions. [2025-03-08 05:29:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:09,149 INFO L276 IsEmpty]: Start isEmpty. Operand 7687 states and 13178 transitions. [2025-03-08 05:29:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 05:29:09,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:09,151 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] [2025-03-08 05:29:09,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:29:09,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:09,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:09,152 INFO L85 PathProgramCache]: Analyzing trace with hash 292459657, now seen corresponding path program 1 times [2025-03-08 05:29:09,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:09,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010511387] [2025-03-08 05:29:09,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:09,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:09,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 05:29:09,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 05:29:09,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:09,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:09,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:09,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010511387] [2025-03-08 05:29:09,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010511387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:09,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:09,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094138097] [2025-03-08 05:29:09,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:09,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:09,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:09,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:09,297 INFO L87 Difference]: Start difference. First operand 7687 states and 13178 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:12,180 INFO L93 Difference]: Finished difference Result 31666 states and 56168 transitions. [2025-03-08 05:29:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 108 [2025-03-08 05:29:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:12,347 INFO L225 Difference]: With dead ends: 31666 [2025-03-08 05:29:12,347 INFO L226 Difference]: Without dead ends: 24028 [2025-03-08 05:29:12,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:12,398 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 3393 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 3402 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3429 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 4415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 3402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:12,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3429 Valid, 2031 Invalid, 4415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 3402 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:29:12,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24028 states. [2025-03-08 05:29:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24028 to 21164. [2025-03-08 05:29:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21164 states, 13882 states have (on average 1.5928540556115833) internal successors, (22112), 15201 states have internal predecessors, (22112), 6636 states have call successors, (6636), 469 states have call predecessors, (6636), 645 states have return successors, (8547), 6695 states have call predecessors, (8547), 6631 states have call successors, (8547) [2025-03-08 05:29:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21164 states to 21164 states and 37295 transitions. [2025-03-08 05:29:14,006 INFO L78 Accepts]: Start accepts. Automaton has 21164 states and 37295 transitions. Word has length 108 [2025-03-08 05:29:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:14,007 INFO L471 AbstractCegarLoop]: Abstraction has 21164 states and 37295 transitions. [2025-03-08 05:29:14,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 21164 states and 37295 transitions. [2025-03-08 05:29:14,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 05:29:14,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:14,010 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] [2025-03-08 05:29:14,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:29:14,011 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:14,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:14,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1734411664, now seen corresponding path program 1 times [2025-03-08 05:29:14,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:14,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282705136] [2025-03-08 05:29:14,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:14,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:14,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 05:29:14,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 05:29:14,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:14,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:14,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:14,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:14,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282705136] [2025-03-08 05:29:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282705136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954200922] [2025-03-08 05:29:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:14,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:14,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:14,133 INFO L87 Difference]: Start difference. First operand 21164 states and 37295 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,608 INFO L93 Difference]: Finished difference Result 94263 states and 171720 transitions. [2025-03-08 05:29:20,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:29:20,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 109 [2025-03-08 05:29:20,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:21,205 INFO L225 Difference]: With dead ends: 94263 [2025-03-08 05:29:21,205 INFO L226 Difference]: Without dead ends: 73152 [2025-03-08 05:29:21,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:21,353 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 3405 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 3411 mSolverCounterSat, 1015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 2052 SdHoareTripleChecker+Invalid, 4426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1015 IncrementalHoareTripleChecker+Valid, 3411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:21,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 2052 Invalid, 4426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1015 Valid, 3411 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 05:29:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73152 states. [2025-03-08 05:29:26,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73152 to 63777. [2025-03-08 05:29:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63777 states, 39854 states have (on average 1.5745470969036985) internal successors, (62752), 44036 states have internal predecessors, (62752), 22353 states have call successors, (22353), 933 states have call predecessors, (22353), 1569 states have return successors, (30701), 22732 states have call predecessors, (30701), 22348 states have call successors, (30701) [2025-03-08 05:29:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63777 states to 63777 states and 115806 transitions. [2025-03-08 05:29:27,317 INFO L78 Accepts]: Start accepts. Automaton has 63777 states and 115806 transitions. Word has length 109 [2025-03-08 05:29:27,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:27,318 INFO L471 AbstractCegarLoop]: Abstraction has 63777 states and 115806 transitions. [2025-03-08 05:29:27,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-08 05:29:27,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63777 states and 115806 transitions. [2025-03-08 05:29:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 05:29:27,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:27,320 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-08 05:29:27,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:29:27,321 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:27,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:27,321 INFO L85 PathProgramCache]: Analyzing trace with hash -499294748, now seen corresponding path program 1 times [2025-03-08 05:29:27,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:27,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545306456] [2025-03-08 05:29:27,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:27,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:27,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 05:29:27,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 05:29:27,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:27,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:27,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 05:29:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:27,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545306456] [2025-03-08 05:29:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545306456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:27,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205881507] [2025-03-08 05:29:27,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:27,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:27,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:27,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:27,562 INFO L87 Difference]: Start difference. First operand 63777 states and 115806 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12)