./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product18.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 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:15:48,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:15:48,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:15:48,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:15:48,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:15:48,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:15:48,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:15:48,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:15:48,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:15:48,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:15:48,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:15:48,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:15:48,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:15:48,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:15:48,331 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:15:48,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:15:48,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:15:48,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:48,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:15:48,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:15:48,333 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 -> 4d9d31939acfea5ee9b43b1f06257671943c7251c27c351c5e445aa6495fd098 [2025-03-03 14:15:48,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:15:48,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:15:48,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:15:48,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:15:48,575 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:15:48,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-03-03 14:15:49,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1d2c2d7/6a727b1ae20b46e8a38d5a36d747dbe8/FLAG6560aa169 [2025-03-03 14:15:50,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:15:50,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product18.cil.c [2025-03-03 14:15:50,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1d2c2d7/6a727b1ae20b46e8a38d5a36d747dbe8/FLAG6560aa169 [2025-03-03 14:15:50,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c1d2c2d7/6a727b1ae20b46e8a38d5a36d747dbe8 [2025-03-03 14:15:50,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:15:50,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:15:50,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:50,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:15:50,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:15:50,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc97dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50, skipping insertion in model container [2025-03-03 14:15:50,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:15:50,565 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_spec2_product18.cil.c[38051,38064] [2025-03-03 14:15:50,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:50,644 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:15:50,650 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [150] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [164] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [284] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [322] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1825] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1834] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2200] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [2552] [2025-03-03 14:15:50,651 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2733] [2025-03-03 14:15:50,700 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_spec2_product18.cil.c[38051,38064] [2025-03-03 14:15:50,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:15:50,762 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:15:50,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50 WrapperNode [2025-03-03 14:15:50,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:15:50,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:50,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:15:50,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:15:50,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,814 INFO L138 Inliner]: procedures = 92, calls = 338, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 813 [2025-03-03 14:15:50,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:15:50,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:15:50,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:15:50,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:15:50,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,851 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:15:50,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,877 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:15:50,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:15:50,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:15:50,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:15:50,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (1/1) ... [2025-03-03 14:15:50,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:15:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:15:50,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:15:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:15:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:15:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:15:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:15:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:15:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:15:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:15:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:15:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:15:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:15:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:15:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:15:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:15:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:15:50,950 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:15:50,950 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:15:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:15:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:15:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:15:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:15:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:15:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:15:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:15:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:15:50,952 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:15:50,952 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:15:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:15:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:15:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:15:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:15:50,954 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:15:50,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-03-03 14:15:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:15:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:15:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:15:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:15:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:15:50,955 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:15:50,955 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:15:51,078 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:15:51,080 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:15:51,124 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L281: #res := ~retValue_acc~2; [2025-03-03 14:15:51,139 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: #res := ~retValue_acc~0; [2025-03-03 14:15:51,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: #res := ~retValue_acc~5; [2025-03-03 14:15:51,426 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1098: #res := ~retValue_acc~13; [2025-03-03 14:15:51,490 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: #res := ~retValue_acc~16; [2025-03-03 14:15:51,503 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L242: #res := ~retValue_acc~1; [2025-03-03 14:15:51,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-03-03 14:15:51,620 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L604-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~8#1; [2025-03-03 14:15:51,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-03 14:15:51,703 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-03 14:15:51,739 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L561-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~6#1; [2025-03-03 14:15:51,787 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3080: #res := ~retValue_acc~24; [2025-03-03 14:15:51,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L319-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-03 14:15:51,838 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2549-1: main_#res#1 := main_~retValue_acc~22#1; [2025-03-03 14:15:51,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844: #res := ~retValue_acc~23; [2025-03-03 14:15:51,848 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~7; [2025-03-03 14:15:51,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3391: #res := ~retValue_acc~25; [2025-03-03 14:15:51,979 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-03-03 14:15:51,979 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:15:51,998 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:15:51,998 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:15:51,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:51 BoogieIcfgContainer [2025-03-03 14:15:51,998 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:15:52,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:15:52,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:15:52,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:15:52,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:15:50" (1/3) ... [2025-03-03 14:15:52,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d35d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:52, skipping insertion in model container [2025-03-03 14:15:52,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:15:50" (2/3) ... [2025-03-03 14:15:52,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d35d725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:15:52, skipping insertion in model container [2025-03-03 14:15:52,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:15:51" (3/3) ... [2025-03-03 14:15:52,005 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2025-03-03 14:15:52,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:15:52,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product18.cil.c that has 23 procedures, 540 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:15:52,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:15:52,095 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;@26c61311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:15:52,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:15:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 540 states, 425 states have (on average 1.7058823529411764) internal successors, (725), 448 states have internal predecessors, (725), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-03 14:15:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:15:52,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:52,110 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] [2025-03-03 14:15:52,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:52,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:52,116 INFO L85 PathProgramCache]: Analyzing trace with hash -314757918, now seen corresponding path program 1 times [2025-03-03 14:15:52,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:52,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065956737] [2025-03-03 14:15:52,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:52,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:52,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:15:52,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:15:52,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:52,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:52,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:52,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065956737] [2025-03-03 14:15:52,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065956737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:52,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:52,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:52,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014171807] [2025-03-03 14:15:52,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:52,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:52,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:52,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:52,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:52,619 INFO L87 Difference]: Start difference. First operand has 540 states, 425 states have (on average 1.7058823529411764) internal successors, (725), 448 states have internal predecessors, (725), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 84 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:52,770 INFO L93 Difference]: Finished difference Result 1060 states and 1789 transitions. [2025-03-03 14:15:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:52,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2025-03-03 14:15:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:52,789 INFO L225 Difference]: With dead ends: 1060 [2025-03-03 14:15:52,789 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:52,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:52,805 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 5 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:52,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2657 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-03 14:15:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.704057279236277) internal successors, (714), 440 states have internal predecessors, (714), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 891 transitions. [2025-03-03 14:15:52,867 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 891 transitions. Word has length 56 [2025-03-03 14:15:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:52,868 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 891 transitions. [2025-03-03 14:15:52,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 891 transitions. [2025-03-03 14:15:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 14:15:52,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:52,875 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] [2025-03-03 14:15:52,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:15:52,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:52,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:52,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2108365766, now seen corresponding path program 1 times [2025-03-03 14:15:52,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:52,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616693827] [2025-03-03 14:15:52,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:52,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 14:15:52,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 14:15:52,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:52,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:53,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616693827] [2025-03-03 14:15:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616693827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445720180] [2025-03-03 14:15:53,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:53,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:53,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,045 INFO L87 Difference]: Start difference. First operand 532 states and 891 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,116 INFO L93 Difference]: Finished difference Result 1046 states and 1759 transitions. [2025-03-03 14:15:53,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:53,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2025-03-03 14:15:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,122 INFO L225 Difference]: With dead ends: 1046 [2025-03-03 14:15:53,122 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:53,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,127 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 4 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2636 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-03 14:15:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.701670644391408) internal successors, (713), 440 states have internal predecessors, (713), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 890 transitions. [2025-03-03 14:15:53,163 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 890 transitions. Word has length 59 [2025-03-03 14:15:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,164 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 890 transitions. [2025-03-03 14:15:53,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 890 transitions. [2025-03-03 14:15:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:15:53,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,167 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] [2025-03-03 14:15:53,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:15:53,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1302655868, now seen corresponding path program 1 times [2025-03-03 14:15:53,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355733643] [2025-03-03 14:15:53,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:15:53,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:15:53,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355733643] [2025-03-03 14:15:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355733643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:53,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573483415] [2025-03-03 14:15:53,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,318 INFO L87 Difference]: Start difference. First operand 532 states and 890 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,382 INFO L93 Difference]: Finished difference Result 1046 states and 1758 transitions. [2025-03-03 14:15:53,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:53,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2025-03-03 14:15:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,388 INFO L225 Difference]: With dead ends: 1046 [2025-03-03 14:15:53,389 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:53,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,392 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 3 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2636 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-03 14:15:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6992840095465394) internal successors, (712), 440 states have internal predecessors, (712), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:53,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 889 transitions. [2025-03-03 14:15:53,415 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 889 transitions. Word has length 60 [2025-03-03 14:15:53,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,416 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 889 transitions. [2025-03-03 14:15:53,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 889 transitions. [2025-03-03 14:15:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 14:15:53,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,418 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] [2025-03-03 14:15:53,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:15:53,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1265193891, now seen corresponding path program 1 times [2025-03-03 14:15:53,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253510513] [2025-03-03 14:15:53,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-03 14:15:53,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 14:15:53,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:53,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253510513] [2025-03-03 14:15:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253510513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533246261] [2025-03-03 14:15:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:53,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,552 INFO L87 Difference]: Start difference. First operand 532 states and 889 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,601 INFO L93 Difference]: Finished difference Result 1046 states and 1757 transitions. [2025-03-03 14:15:53,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:53,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2025-03-03 14:15:53,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,606 INFO L225 Difference]: With dead ends: 1046 [2025-03-03 14:15:53,606 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:53,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,610 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 2 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2636 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:53,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-03 14:15:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.6968973747016707) internal successors, (711), 440 states have internal predecessors, (711), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 888 transitions. [2025-03-03 14:15:53,637 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 888 transitions. Word has length 61 [2025-03-03 14:15:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,638 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 888 transitions. [2025-03-03 14:15:53,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 888 transitions. [2025-03-03 14:15:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 14:15:53,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,640 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] [2025-03-03 14:15:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:15:53,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,642 INFO L85 PathProgramCache]: Analyzing trace with hash -726386311, now seen corresponding path program 1 times [2025-03-03 14:15:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928502769] [2025-03-03 14:15:53,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 14:15:53,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 14:15:53,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:53,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:53,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928502769] [2025-03-03 14:15:53,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928502769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:53,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:53,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:53,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690192989] [2025-03-03 14:15:53,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:53,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:53,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:53,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:53,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,755 INFO L87 Difference]: Start difference. First operand 532 states and 888 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:53,795 INFO L93 Difference]: Finished difference Result 1046 states and 1756 transitions. [2025-03-03 14:15:53,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:53,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 62 [2025-03-03 14:15:53,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:53,799 INFO L225 Difference]: With dead ends: 1046 [2025-03-03 14:15:53,799 INFO L226 Difference]: Without dead ends: 532 [2025-03-03 14:15:53,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:53,804 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 1 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:53,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2636 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-03 14:15:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-03-03 14:15:53,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 419 states have (on average 1.694510739856802) internal successors, (710), 440 states have internal predecessors, (710), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 887 transitions. [2025-03-03 14:15:53,825 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 887 transitions. Word has length 62 [2025-03-03 14:15:53,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:53,825 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 887 transitions. [2025-03-03 14:15:53,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 887 transitions. [2025-03-03 14:15:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:15:53,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:53,827 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] [2025-03-03 14:15:53,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:15:53,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:53,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1128877952, now seen corresponding path program 1 times [2025-03-03 14:15:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744138673] [2025-03-03 14:15:53,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:53,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:53,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:15:53,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:15:53,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:53,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:54,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744138673] [2025-03-03 14:15:54,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744138673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:15:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300854211] [2025-03-03 14:15:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:15:54,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:15:54,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:15:54,056 INFO L87 Difference]: Start difference. First operand 532 states and 887 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:15:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,153 INFO L93 Difference]: Finished difference Result 1012 states and 1688 transitions. [2025-03-03 14:15:54,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:15:54,153 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2025-03-03 14:15:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,157 INFO L225 Difference]: With dead ends: 1012 [2025-03-03 14:15:54,157 INFO L226 Difference]: Without dead ends: 547 [2025-03-03 14:15:54,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:54,160 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 91 mSDsluCounter, 6042 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6917 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:54,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6917 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-03 14:15:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-03-03 14:15:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 429 states have (on average 1.68997668997669) internal successors, (725), 452 states have internal predecessors, (725), 92 states have call successors, (92), 22 states have call predecessors, (92), 23 states have return successors, (89), 84 states have call predecessors, (89), 87 states have call successors, (89) [2025-03-03 14:15:54,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 906 transitions. [2025-03-03 14:15:54,179 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 906 transitions. Word has length 63 [2025-03-03 14:15:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,180 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 906 transitions. [2025-03-03 14:15:54,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:15:54,180 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 906 transitions. [2025-03-03 14:15:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:15:54,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,181 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] [2025-03-03 14:15:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:15:54,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -54469345, now seen corresponding path program 1 times [2025-03-03 14:15:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680362819] [2025-03-03 14:15:54,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:15:54,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:15:54,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:54,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680362819] [2025-03-03 14:15:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680362819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:15:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024990208] [2025-03-03 14:15:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:15:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:15:54,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:54,263 INFO L87 Difference]: Start difference. First operand 545 states and 906 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:54,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,297 INFO L93 Difference]: Finished difference Result 1064 states and 1782 transitions. [2025-03-03 14:15:54,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:15:54,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 63 [2025-03-03 14:15:54,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,301 INFO L225 Difference]: With dead ends: 1064 [2025-03-03 14:15:54,301 INFO L226 Difference]: Without dead ends: 526 [2025-03-03 14:15:54,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:15:54,303 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 0 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:54,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2638 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:54,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-03 14:15:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-03 14:15:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.685230024213075) internal successors, (696), 434 states have internal predecessors, (696), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 873 transitions. [2025-03-03 14:15:54,317 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 873 transitions. Word has length 63 [2025-03-03 14:15:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,318 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 873 transitions. [2025-03-03 14:15:54,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 873 transitions. [2025-03-03 14:15:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:15:54,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,319 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] [2025-03-03 14:15:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:15:54,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1078336222, now seen corresponding path program 1 times [2025-03-03 14:15:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033493584] [2025-03-03 14:15:54,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:15:54,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:15:54,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:54,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033493584] [2025-03-03 14:15:54,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033493584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:54,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607065361] [2025-03-03 14:15:54,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:54,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:54,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:54,422 INFO L87 Difference]: Start difference. First operand 526 states and 873 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:54,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,583 INFO L93 Difference]: Finished difference Result 1009 states and 1680 transitions. [2025-03-03 14:15:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:54,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 64 [2025-03-03 14:15:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,587 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 14:15:54,587 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 14:15:54,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:54,590 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 55 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4121 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-03 14:15:54,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4121 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 14:15:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-03-03 14:15:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.675544794188862) internal successors, (692), 434 states have internal predecessors, (692), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 869 transitions. [2025-03-03 14:15:54,609 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 869 transitions. Word has length 64 [2025-03-03 14:15:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,609 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 869 transitions. [2025-03-03 14:15:54,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 869 transitions. [2025-03-03 14:15:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:15:54,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,611 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] [2025-03-03 14:15:54,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:15:54,611 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1741997975, now seen corresponding path program 1 times [2025-03-03 14:15:54,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904409627] [2025-03-03 14:15:54,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:15:54,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:15:54,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:54,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904409627] [2025-03-03 14:15:54,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904409627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:54,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:54,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612321886] [2025-03-03 14:15:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:54,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:54,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:54,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:54,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:54,742 INFO L87 Difference]: Start difference. First operand 526 states and 869 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:54,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:54,880 INFO L93 Difference]: Finished difference Result 1009 states and 1676 transitions. [2025-03-03 14:15:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:54,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 65 [2025-03-03 14:15:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:54,884 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 14:15:54,884 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 14:15:54,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:54,889 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 54 mSDsluCounter, 3291 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4121 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:54,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4121 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 14:15:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-03-03 14:15:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.665859564164649) internal successors, (688), 434 states have internal predecessors, (688), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 865 transitions. [2025-03-03 14:15:54,908 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 865 transitions. Word has length 65 [2025-03-03 14:15:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:54,908 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 865 transitions. [2025-03-03 14:15:54,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 865 transitions. [2025-03-03 14:15:54,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:15:54,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:54,911 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] [2025-03-03 14:15:54,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:15:54,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:54,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1289799553, now seen corresponding path program 1 times [2025-03-03 14:15:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306108303] [2025-03-03 14:15:54,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:54,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:54,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:15:54,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:15:54,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:54,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306108303] [2025-03-03 14:15:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306108303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205554108] [2025-03-03 14:15:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:55,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:55,009 INFO L87 Difference]: Start difference. First operand 526 states and 865 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:55,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,135 INFO L93 Difference]: Finished difference Result 1009 states and 1672 transitions. [2025-03-03 14:15:55,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2025-03-03 14:15:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,139 INFO L225 Difference]: With dead ends: 1009 [2025-03-03 14:15:55,139 INFO L226 Difference]: Without dead ends: 535 [2025-03-03 14:15:55,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:55,142 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 53 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4103 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-03 14:15:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-03-03 14:15:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 413 states have (on average 1.6561743341404358) internal successors, (684), 434 states have internal predecessors, (684), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 861 transitions. [2025-03-03 14:15:55,158 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 861 transitions. Word has length 66 [2025-03-03 14:15:55,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,159 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 861 transitions. [2025-03-03 14:15:55,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 861 transitions. [2025-03-03 14:15:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:15:55,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,162 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] [2025-03-03 14:15:55,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:15:55,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1099301744, now seen corresponding path program 1 times [2025-03-03 14:15:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769498821] [2025-03-03 14:15:55,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:15:55,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:15:55,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:55,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769498821] [2025-03-03 14:15:55,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769498821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:15:55,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275054371] [2025-03-03 14:15:55,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:15:55,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:15:55,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:55,275 INFO L87 Difference]: Start difference. First operand 526 states and 861 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:15:55,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,345 INFO L93 Difference]: Finished difference Result 1000 states and 1654 transitions. [2025-03-03 14:15:55,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:15:55,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 66 [2025-03-03 14:15:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,348 INFO L225 Difference]: With dead ends: 1000 [2025-03-03 14:15:55,348 INFO L226 Difference]: Without dead ends: 505 [2025-03-03 14:15:55,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:15:55,352 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 84 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5027 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-03 14:15:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-03 14:15:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6581632653061225) internal successors, (650), 413 states have internal predecessors, (650), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 827 transitions. [2025-03-03 14:15:55,366 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 827 transitions. Word has length 66 [2025-03-03 14:15:55,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,366 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 827 transitions. [2025-03-03 14:15:55,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:15:55,366 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 827 transitions. [2025-03-03 14:15:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:15:55,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,367 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] [2025-03-03 14:15:55,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:15:55,367 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash 605674074, now seen corresponding path program 1 times [2025-03-03 14:15:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46411685] [2025-03-03 14:15:55,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:15:55,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:15:55,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46411685] [2025-03-03 14:15:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46411685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947745324] [2025-03-03 14:15:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:55,448 INFO L87 Difference]: Start difference. First operand 505 states and 827 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:55,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,513 INFO L93 Difference]: Finished difference Result 979 states and 1620 transitions. [2025-03-03 14:15:55,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:55,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 67 [2025-03-03 14:15:55,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,517 INFO L225 Difference]: With dead ends: 979 [2025-03-03 14:15:55,518 INFO L226 Difference]: Without dead ends: 505 [2025-03-03 14:15:55,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:55,521 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 17 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4041 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-03 14:15:55,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-03 14:15:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.655612244897959) internal successors, (649), 413 states have internal predecessors, (649), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 826 transitions. [2025-03-03 14:15:55,541 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 826 transitions. Word has length 67 [2025-03-03 14:15:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,541 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 826 transitions. [2025-03-03 14:15:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 826 transitions. [2025-03-03 14:15:55,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:15:55,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,543 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] [2025-03-03 14:15:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:15:55,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1321744420, now seen corresponding path program 1 times [2025-03-03 14:15:55,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383538392] [2025-03-03 14:15:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:15:55,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:15:55,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383538392] [2025-03-03 14:15:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383538392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755879356] [2025-03-03 14:15:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:55,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:55,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:55,630 INFO L87 Difference]: Start difference. First operand 505 states and 826 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,687 INFO L93 Difference]: Finished difference Result 979 states and 1619 transitions. [2025-03-03 14:15:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2025-03-03 14:15:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,691 INFO L225 Difference]: With dead ends: 979 [2025-03-03 14:15:55,691 INFO L226 Difference]: Without dead ends: 505 [2025-03-03 14:15:55,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:15:55,694 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 16 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4041 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4041 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:15:55,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-03 14:15:55,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-03 14:15:55,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.653061224489796) internal successors, (648), 413 states have internal predecessors, (648), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:55,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 825 transitions. [2025-03-03 14:15:55,707 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 825 transitions. Word has length 68 [2025-03-03 14:15:55,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,707 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 825 transitions. [2025-03-03 14:15:55,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-03 14:15:55,707 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 825 transitions. [2025-03-03 14:15:55,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:15:55,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,709 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:55,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:15:55,709 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1800754915, now seen corresponding path program 1 times [2025-03-03 14:15:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624809636] [2025-03-03 14:15:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:55,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:15:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:15:55,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:55,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624809636] [2025-03-03 14:15:55,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624809636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:55,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:55,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:15:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117214750] [2025-03-03 14:15:55,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:55,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:15:55,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:55,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:15:55,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:55,884 INFO L87 Difference]: Start difference. First operand 505 states and 825 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:15:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:55,972 INFO L93 Difference]: Finished difference Result 973 states and 1607 transitions. [2025-03-03 14:15:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:15:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2025-03-03 14:15:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:55,976 INFO L225 Difference]: With dead ends: 973 [2025-03-03 14:15:55,976 INFO L226 Difference]: Without dead ends: 505 [2025-03-03 14:15:55,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:15:55,979 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 6 mSDsluCounter, 6450 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7259 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:55,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7259 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:15:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-03 14:15:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-03 14:15:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 392 states have (on average 1.6505102040816326) internal successors, (647), 413 states have internal predecessors, (647), 91 states have call successors, (91), 22 states have call predecessors, (91), 21 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 14:15:55,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 824 transitions. [2025-03-03 14:15:55,995 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 824 transitions. Word has length 69 [2025-03-03 14:15:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:55,995 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 824 transitions. [2025-03-03 14:15:55,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 14:15:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 824 transitions. [2025-03-03 14:15:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:15:55,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:55,996 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] [2025-03-03 14:15:55,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:15:55,997 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1778362121, now seen corresponding path program 1 times [2025-03-03 14:15:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062415279] [2025-03-03 14:15:55,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:56,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:15:56,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:15:56,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:56,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:56,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:56,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062415279] [2025-03-03 14:15:56,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062415279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:56,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:56,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:15:56,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437510943] [2025-03-03 14:15:56,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:56,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:15:56,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:56,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:15:56,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:15:56,170 INFO L87 Difference]: Start difference. First operand 505 states and 824 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:15:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:15:57,768 INFO L93 Difference]: Finished difference Result 1568 states and 2623 transitions. [2025-03-03 14:15:57,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:15:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 70 [2025-03-03 14:15:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:15:57,776 INFO L225 Difference]: With dead ends: 1568 [2025-03-03 14:15:57,776 INFO L226 Difference]: Without dead ends: 1108 [2025-03-03 14:15:57,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:15:57,780 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1900 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:15:57,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 1327 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1817 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:15:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-03 14:15:57,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 986. [2025-03-03 14:15:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 774 states have (on average 1.6744186046511629) internal successors, (1296), 804 states have internal predecessors, (1296), 174 states have call successors, (174), 36 states have call predecessors, (174), 37 states have return successors, (176), 158 states have call predecessors, (176), 169 states have call successors, (176) [2025-03-03 14:15:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1646 transitions. [2025-03-03 14:15:57,826 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1646 transitions. Word has length 70 [2025-03-03 14:15:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:15:57,826 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1646 transitions. [2025-03-03 14:15:57,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:15:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1646 transitions. [2025-03-03 14:15:57,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:15:57,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:15:57,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:15:57,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:15:57,829 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:15:57,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:15:57,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1069377053, now seen corresponding path program 1 times [2025-03-03 14:15:57,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:15:57,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854976406] [2025-03-03 14:15:57,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:15:57,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:15:57,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:15:57,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:15:57,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:15:57,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:15:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:15:58,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:15:58,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854976406] [2025-03-03 14:15:58,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854976406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:15:58,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:15:58,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 14:15:58,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226593381] [2025-03-03 14:15:58,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:15:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:15:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:15:58,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:15:58,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:15:58,080 INFO L87 Difference]: Start difference. First operand 986 states and 1646 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:01,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:01,880 INFO L93 Difference]: Finished difference Result 3574 states and 6001 transitions. [2025-03-03 14:16:01,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:16:01,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 98 [2025-03-03 14:16:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:01,894 INFO L225 Difference]: With dead ends: 3574 [2025-03-03 14:16:01,894 INFO L226 Difference]: Without dead ends: 2633 [2025-03-03 14:16:01,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:16:01,899 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 2633 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 8750 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2707 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 9571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 8750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:01,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2707 Valid, 4680 Invalid, 9571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 8750 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-03 14:16:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-03-03 14:16:02,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2539. [2025-03-03 14:16:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2539 states, 1931 states have (on average 1.6447436561367168) internal successors, (3176), 2007 states have internal predecessors, (3176), 513 states have call successors, (513), 77 states have call predecessors, (513), 94 states have return successors, (546), 487 states have call predecessors, (546), 508 states have call successors, (546) [2025-03-03 14:16:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2539 states to 2539 states and 4235 transitions. [2025-03-03 14:16:02,023 INFO L78 Accepts]: Start accepts. Automaton has 2539 states and 4235 transitions. Word has length 98 [2025-03-03 14:16:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:02,023 INFO L471 AbstractCegarLoop]: Abstraction has 2539 states and 4235 transitions. [2025-03-03 14:16:02,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2539 states and 4235 transitions. [2025-03-03 14:16:02,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:16:02,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:02,026 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-03 14:16:02,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:16:02,026 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:02,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:02,027 INFO L85 PathProgramCache]: Analyzing trace with hash -124391323, now seen corresponding path program 1 times [2025-03-03 14:16:02,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:02,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928817554] [2025-03-03 14:16:02,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:02,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:02,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:16:02,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:16:02,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:02,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928817554] [2025-03-03 14:16:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928817554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:02,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:02,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:16:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849896450] [2025-03-03 14:16:02,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:02,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:02,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:02,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:02,295 INFO L87 Difference]: Start difference. First operand 2539 states and 4235 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:16:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:03,425 INFO L93 Difference]: Finished difference Result 5061 states and 8590 transitions. [2025-03-03 14:16:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:16:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2025-03-03 14:16:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:03,439 INFO L225 Difference]: With dead ends: 5061 [2025-03-03 14:16:03,439 INFO L226 Difference]: Without dead ends: 2567 [2025-03-03 14:16:03,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:03,449 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 1256 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:03,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1627 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 14:16:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2025-03-03 14:16:03,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2563. [2025-03-03 14:16:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 1949 states have (on average 1.6387891226269882) internal successors, (3194), 2025 states have internal predecessors, (3194), 513 states have call successors, (513), 77 states have call predecessors, (513), 100 states have return successors, (612), 493 states have call predecessors, (612), 508 states have call successors, (612) [2025-03-03 14:16:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4319 transitions. [2025-03-03 14:16:03,551 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4319 transitions. Word has length 99 [2025-03-03 14:16:03,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:03,552 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4319 transitions. [2025-03-03 14:16:03,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:16:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4319 transitions. [2025-03-03 14:16:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:16:03,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:03,555 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-03 14:16:03,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:16:03,555 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 265839149, now seen corresponding path program 1 times [2025-03-03 14:16:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758070186] [2025-03-03 14:16:03,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:03,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-03 14:16:03,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:16:03,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:03,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758070186] [2025-03-03 14:16:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758070186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:03,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009415173] [2025-03-03 14:16:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:03,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:03,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:03,709 INFO L87 Difference]: Start difference. First operand 2563 states and 4319 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:05,695 INFO L93 Difference]: Finished difference Result 8191 states and 14082 transitions. [2025-03-03 14:16:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:16:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 100 [2025-03-03 14:16:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:05,726 INFO L225 Difference]: With dead ends: 8191 [2025-03-03 14:16:05,726 INFO L226 Difference]: Without dead ends: 5673 [2025-03-03 14:16:05,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:16:05,739 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 2622 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 4160 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 4848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 4160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:05,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2691 Valid, 2553 Invalid, 4848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 4160 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:16:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2025-03-03 14:16:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 5442. [2025-03-03 14:16:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5442 states, 4131 states have (on average 1.6276930525296538) internal successors, (6724), 4312 states have internal predecessors, (6724), 1088 states have call successors, (1088), 190 states have call predecessors, (1088), 222 states have return successors, (1237), 1016 states have call predecessors, (1237), 1083 states have call successors, (1237) [2025-03-03 14:16:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5442 states to 5442 states and 9049 transitions. [2025-03-03 14:16:06,003 INFO L78 Accepts]: Start accepts. Automaton has 5442 states and 9049 transitions. Word has length 100 [2025-03-03 14:16:06,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:06,004 INFO L471 AbstractCegarLoop]: Abstraction has 5442 states and 9049 transitions. [2025-03-03 14:16:06,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 5442 states and 9049 transitions. [2025-03-03 14:16:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:16:06,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:06,008 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-03 14:16:06,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:16:06,008 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:06,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -262852689, now seen corresponding path program 1 times [2025-03-03 14:16:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172630491] [2025-03-03 14:16:06,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:06,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:16:06,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:16:06,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:06,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:06,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172630491] [2025-03-03 14:16:06,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172630491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:06,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:06,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404739989] [2025-03-03 14:16:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:06,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:06,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:06,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:06,208 INFO L87 Difference]: Start difference. First operand 5442 states and 9049 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:08,749 INFO L93 Difference]: Finished difference Result 18887 states and 31942 transitions. [2025-03-03 14:16:08,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:16:08,750 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2025-03-03 14:16:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:08,817 INFO L225 Difference]: With dead ends: 18887 [2025-03-03 14:16:08,817 INFO L226 Difference]: Without dead ends: 13484 [2025-03-03 14:16:08,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:16:08,843 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 2783 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 5153 mSolverCounterSat, 653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2890 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 5806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 653 IncrementalHoareTripleChecker+Valid, 5153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:08,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2890 Valid, 2411 Invalid, 5806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [653 Valid, 5153 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 14:16:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13484 states. [2025-03-03 14:16:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13484 to 11440. [2025-03-03 14:16:09,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11440 states, 8376 states have (on average 1.6171203438395416) internal successors, (13545), 8858 states have internal predecessors, (13545), 2618 states have call successors, (2618), 362 states have call predecessors, (2618), 445 states have return successors, (3154), 2529 states have call predecessors, (3154), 2613 states have call successors, (3154) [2025-03-03 14:16:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 19317 transitions. [2025-03-03 14:16:09,475 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 19317 transitions. Word has length 102 [2025-03-03 14:16:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 11440 states and 19317 transitions. [2025-03-03 14:16:09,476 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, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:09,476 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 19317 transitions. [2025-03-03 14:16:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:16:09,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:09,478 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-03 14:16:09,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:16:09,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:09,479 INFO L85 PathProgramCache]: Analyzing trace with hash 160794033, now seen corresponding path program 1 times [2025-03-03 14:16:09,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:09,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335066543] [2025-03-03 14:16:09,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:09,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:09,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:16:09,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:16:09,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:09,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:09,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:09,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:09,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335066543] [2025-03-03 14:16:09,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335066543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:09,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:09,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:09,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628682099] [2025-03-03 14:16:09,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:09,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:09,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:09,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:09,642 INFO L87 Difference]: Start difference. First operand 11440 states and 19317 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:12,068 INFO L93 Difference]: Finished difference Result 34307 states and 58799 transitions. [2025-03-03 14:16:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:16:12,069 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2025-03-03 14:16:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:12,182 INFO L225 Difference]: With dead ends: 34307 [2025-03-03 14:16:12,183 INFO L226 Difference]: Without dead ends: 24393 [2025-03-03 14:16:12,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:16:12,223 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2312 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:12,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 1752 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 3491 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 14:16:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24393 states. [2025-03-03 14:16:13,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24393 to 23384. [2025-03-03 14:16:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23384 states, 17158 states have (on average 1.6171465205734934) internal successors, (27747), 18183 states have internal predecessors, (27747), 5199 states have call successors, (5199), 716 states have call predecessors, (5199), 1026 states have return successors, (6834), 5059 states have call predecessors, (6834), 5194 states have call successors, (6834) [2025-03-03 14:16:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23384 states to 23384 states and 39780 transitions. [2025-03-03 14:16:13,709 INFO L78 Accepts]: Start accepts. Automaton has 23384 states and 39780 transitions. Word has length 102 [2025-03-03 14:16:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:13,710 INFO L471 AbstractCegarLoop]: Abstraction has 23384 states and 39780 transitions. [2025-03-03 14:16:13,710 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, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:16:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 23384 states and 39780 transitions. [2025-03-03 14:16:13,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:16:13,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:13,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:13,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:16:13,713 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1539687800, now seen corresponding path program 1 times [2025-03-03 14:16:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179152185] [2025-03-03 14:16:13,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:13,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:13,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:16:13,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:16:13,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:13,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:13,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:13,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179152185] [2025-03-03 14:16:13,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179152185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:13,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:13,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:16:13,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168306223] [2025-03-03 14:16:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:13,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:13,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:13,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:13,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:16:13,810 INFO L87 Difference]: Start difference. First operand 23384 states and 39780 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:16:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:14,746 INFO L93 Difference]: Finished difference Result 45338 states and 77482 transitions. [2025-03-03 14:16:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:14,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-03-03 14:16:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:14,878 INFO L225 Difference]: With dead ends: 45338 [2025-03-03 14:16:14,878 INFO L226 Difference]: Without dead ends: 23700 [2025-03-03 14:16:14,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:16:14,960 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 0 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:14,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3258 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23700 states. [2025-03-03 14:16:16,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23700 to 23640. [2025-03-03 14:16:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23640 states, 17356 states have (on average 1.6094146116616732) internal successors, (27933), 18375 states have internal predecessors, (27933), 5187 states have call successors, (5187), 716 states have call predecessors, (5187), 1096 states have return successors, (7055), 5123 states have call predecessors, (7055), 5182 states have call successors, (7055) [2025-03-03 14:16:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23640 states to 23640 states and 40175 transitions. [2025-03-03 14:16:16,175 INFO L78 Accepts]: Start accepts. Automaton has 23640 states and 40175 transitions. Word has length 107 [2025-03-03 14:16:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:16,176 INFO L471 AbstractCegarLoop]: Abstraction has 23640 states and 40175 transitions. [2025-03-03 14:16:16,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 states have internal predecessors, (84), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:16:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 23640 states and 40175 transitions. [2025-03-03 14:16:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:16:16,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:16,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:16,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:16:16,179 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:16,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:16,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2056779496, now seen corresponding path program 1 times [2025-03-03 14:16:16,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:16,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374768011] [2025-03-03 14:16:16,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:16,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:16,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:16:16,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:16:16,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:16,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:16:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374768011] [2025-03-03 14:16:16,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374768011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:16,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:16,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:16,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559491148] [2025-03-03 14:16:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:16,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:16,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:16,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:16,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:16,365 INFO L87 Difference]: Start difference. First operand 23640 states and 40175 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:16:18,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:18,077 INFO L93 Difference]: Finished difference Result 49526 states and 86128 transitions. [2025-03-03 14:16:18,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:16:18,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 114 [2025-03-03 14:16:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:18,236 INFO L225 Difference]: With dead ends: 49526 [2025-03-03 14:16:18,236 INFO L226 Difference]: Without dead ends: 24196 [2025-03-03 14:16:18,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:18,360 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 225 mSDsluCounter, 3203 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:18,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4067 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24196 states. [2025-03-03 14:16:19,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24196 to 23712. [2025-03-03 14:16:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23712 states, 17419 states have (on average 1.5804581204431942) internal successors, (27530), 18447 states have internal predecessors, (27530), 5187 states have call successors, (5187), 716 states have call predecessors, (5187), 1105 states have return successors, (7091), 5123 states have call predecessors, (7091), 5182 states have call successors, (7091) [2025-03-03 14:16:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23712 states to 23712 states and 39808 transitions. [2025-03-03 14:16:19,594 INFO L78 Accepts]: Start accepts. Automaton has 23712 states and 39808 transitions. Word has length 114 [2025-03-03 14:16:19,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:19,594 INFO L471 AbstractCegarLoop]: Abstraction has 23712 states and 39808 transitions. [2025-03-03 14:16:19,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:16:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23712 states and 39808 transitions. [2025-03-03 14:16:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:16:19,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:19,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:19,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:16:19,598 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:19,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -269810910, now seen corresponding path program 1 times [2025-03-03 14:16:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:19,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579440010] [2025-03-03 14:16:19,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:19,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:16:19,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:16:19,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:19,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:16:19,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:19,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579440010] [2025-03-03 14:16:19,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579440010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:19,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:19,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:19,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418126757] [2025-03-03 14:16:19,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:19,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:19,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:19,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:19,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:19,741 INFO L87 Difference]: Start difference. First operand 23712 states and 39808 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:16:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:22,486 INFO L93 Difference]: Finished difference Result 48340 states and 81503 transitions. [2025-03-03 14:16:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:16:22,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2025-03-03 14:16:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:22,636 INFO L225 Difference]: With dead ends: 48340 [2025-03-03 14:16:22,636 INFO L226 Difference]: Without dead ends: 26395 [2025-03-03 14:16:22,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:16:22,733 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2027 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 3008 mSolverCounterSat, 474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 474 IncrementalHoareTripleChecker+Valid, 3008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:22,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 1705 Invalid, 3482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [474 Valid, 3008 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 14:16:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26395 states. [2025-03-03 14:16:23,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26395 to 24880. [2025-03-03 14:16:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24880 states, 18292 states have (on average 1.5678438661710037) internal successors, (28679), 19394 states have internal predecessors, (28679), 5302 states have call successors, (5302), 821 states have call predecessors, (5302), 1285 states have return successors, (7509), 5239 states have call predecessors, (7509), 5297 states have call successors, (7509) [2025-03-03 14:16:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24880 states to 24880 states and 41490 transitions. [2025-03-03 14:16:23,950 INFO L78 Accepts]: Start accepts. Automaton has 24880 states and 41490 transitions. Word has length 119 [2025-03-03 14:16:23,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:23,951 INFO L471 AbstractCegarLoop]: Abstraction has 24880 states and 41490 transitions. [2025-03-03 14:16:23,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:16:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 24880 states and 41490 transitions. [2025-03-03 14:16:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:16:23,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:23,954 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:23,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:16:23,954 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:23,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1866558462, now seen corresponding path program 1 times [2025-03-03 14:16:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:23,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387178559] [2025-03-03 14:16:23,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:23,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:16:23,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:16:23,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:23,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:16:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:24,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387178559] [2025-03-03 14:16:24,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387178559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:24,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:16:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563815080] [2025-03-03 14:16:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:24,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:16:24,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:24,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:16:24,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:16:24,064 INFO L87 Difference]: Start difference. First operand 24880 states and 41490 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:16:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:26,468 INFO L93 Difference]: Finished difference Result 59672 states and 100403 transitions. [2025-03-03 14:16:26,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:26,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 124 [2025-03-03 14:16:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:26,691 INFO L225 Difference]: With dead ends: 59672 [2025-03-03 14:16:26,692 INFO L226 Difference]: Without dead ends: 36559 [2025-03-03 14:16:26,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:16:26,817 INFO L435 NwaCegarLoop]: 1329 mSDtfsCounter, 756 mSDsluCounter, 3448 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 4777 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:26,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 4777 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:26,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36559 states. [2025-03-03 14:16:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36559 to 33916. [2025-03-03 14:16:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33916 states, 24892 states have (on average 1.575405752852322) internal successors, (39215), 26336 states have internal predecessors, (39215), 7394 states have call successors, (7394), 1047 states have call predecessors, (7394), 1629 states have return successors, (10370), 7372 states have call predecessors, (10370), 7389 states have call successors, (10370) [2025-03-03 14:16:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33916 states to 33916 states and 56979 transitions. [2025-03-03 14:16:28,451 INFO L78 Accepts]: Start accepts. Automaton has 33916 states and 56979 transitions. Word has length 124 [2025-03-03 14:16:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:28,452 INFO L471 AbstractCegarLoop]: Abstraction has 33916 states and 56979 transitions. [2025-03-03 14:16:28,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 14:16:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33916 states and 56979 transitions. [2025-03-03 14:16:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:16:28,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:28,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:28,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:16:28,455 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:28,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash -210650881, now seen corresponding path program 1 times [2025-03-03 14:16:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111149890] [2025-03-03 14:16:28,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:28,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:16:28,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:16:28,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:28,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:16:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111149890] [2025-03-03 14:16:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111149890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:28,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:28,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972988763] [2025-03-03 14:16:28,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:28,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:28,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:28,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:28,561 INFO L87 Difference]: Start difference. First operand 33916 states and 56979 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:30,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:30,054 INFO L93 Difference]: Finished difference Result 34086 states and 57285 transitions. [2025-03-03 14:16:30,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:16:30,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-03 14:16:30,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:30,453 INFO L225 Difference]: With dead ends: 34086 [2025-03-03 14:16:30,453 INFO L226 Difference]: Without dead ends: 34071 [2025-03-03 14:16:30,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:30,470 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 883 mSDsluCounter, 2071 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:30,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2875 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:16:30,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34071 states. [2025-03-03 14:16:32,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34071 to 33931. [2025-03-03 14:16:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33931 states, 24907 states have (on average 1.5750592202995142) internal successors, (39230), 26351 states have internal predecessors, (39230), 7394 states have call successors, (7394), 1047 states have call predecessors, (7394), 1629 states have return successors, (10370), 7372 states have call predecessors, (10370), 7389 states have call successors, (10370) [2025-03-03 14:16:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33931 states to 33931 states and 56994 transitions. [2025-03-03 14:16:32,805 INFO L78 Accepts]: Start accepts. Automaton has 33931 states and 56994 transitions. Word has length 124 [2025-03-03 14:16:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:32,806 INFO L471 AbstractCegarLoop]: Abstraction has 33931 states and 56994 transitions. [2025-03-03 14:16:32,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:16:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 33931 states and 56994 transitions. [2025-03-03 14:16:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:16:32,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:32,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:32,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:16:32,809 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:32,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:32,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1458685081, now seen corresponding path program 1 times [2025-03-03 14:16:32,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:32,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806640149] [2025-03-03 14:16:32,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:32,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:32,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:16:32,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:16:32,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:32,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:16:33,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806640149] [2025-03-03 14:16:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806640149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:33,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:16:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768880890] [2025-03-03 14:16:33,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:33,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:16:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:33,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:16:33,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:16:33,054 INFO L87 Difference]: Start difference. First operand 33931 states and 56994 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:37,545 INFO L93 Difference]: Finished difference Result 77290 states and 129645 transitions. [2025-03-03 14:16:37,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:16:37,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 132 [2025-03-03 14:16:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:37,819 INFO L225 Difference]: With dead ends: 77290 [2025-03-03 14:16:37,819 INFO L226 Difference]: Without dead ends: 44846 [2025-03-03 14:16:37,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:16:37,947 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2746 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 6010 mSolverCounterSat, 646 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2831 SdHoareTripleChecker+Valid, 3254 SdHoareTripleChecker+Invalid, 6656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 6010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:37,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2831 Valid, 3254 Invalid, 6656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 6010 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:16:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44846 states. [2025-03-03 14:16:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44846 to 40228. [2025-03-03 14:16:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40228 states, 29865 states have (on average 1.5588146659969864) internal successors, (46554), 31571 states have internal predecessors, (46554), 8186 states have call successors, (8186), 1404 states have call predecessors, (8186), 2176 states have return successors, (11607), 8090 states have call predecessors, (11607), 8181 states have call successors, (11607) [2025-03-03 14:16:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40228 states to 40228 states and 66347 transitions. [2025-03-03 14:16:39,902 INFO L78 Accepts]: Start accepts. Automaton has 40228 states and 66347 transitions. Word has length 132 [2025-03-03 14:16:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 40228 states and 66347 transitions. [2025-03-03 14:16:39,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-03 14:16:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40228 states and 66347 transitions. [2025-03-03 14:16:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:16:39,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:39,904 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:39,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:16:39,905 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:39,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1070861091, now seen corresponding path program 1 times [2025-03-03 14:16:39,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:39,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568873847] [2025-03-03 14:16:39,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:39,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:16:39,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:16:39,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:39,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:16:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:40,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568873847] [2025-03-03 14:16:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568873847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:40,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:40,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:16:40,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551767074] [2025-03-03 14:16:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:40,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:40,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:40,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:40,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:40,257 INFO L87 Difference]: Start difference. First operand 40228 states and 66347 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 3 states have call successors, (15), 2 states have call predecessors, (15), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14)