./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product11.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 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:37:25,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:37:25,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:37:25,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:37:25,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:37:25,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:37:25,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:37:25,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:37:25,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:37:25,278 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:37:25,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:37:25,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:37:25,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:37:25,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:37:25,279 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:37:25,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:37:25,280 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:37:25,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:37:25,280 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:37:25,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:37:25,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:37:25,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:37:25,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:37:25,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:37:25,281 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 -> 2156ba1e79a86c856553f139302f2b9940a34efa4e31eb139d6bea893c29b00d [2025-03-16 18:37:25,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:37:25,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:37:25,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:37:25,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:37:25,526 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:37:25,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2025-03-16 18:37:26,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ca656b4/bde74437a62c449d954c0ca107015295/FLAG7571aeae0 [2025-03-16 18:37:27,086 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:37:27,086 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c [2025-03-16 18:37:27,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ca656b4/bde74437a62c449d954c0ca107015295/FLAG7571aeae0 [2025-03-16 18:37:27,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57ca656b4/bde74437a62c449d954c0ca107015295 [2025-03-16 18:37:27,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:37:27,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:37:27,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:37:27,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:37:27,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:37:27,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ada82c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27, skipping insertion in model container [2025-03-16 18:37:27,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:37:27,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c[71954,71967] [2025-03-16 18:37:27,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:37:27,598 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:37:27,604 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-16 18:37:27,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [148] [2025-03-16 18:37:27,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [505] [2025-03-16 18:37:27,605 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [871] [2025-03-16 18:37:27,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1034] [2025-03-16 18:37:27,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1069] [2025-03-16 18:37:27,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1189] [2025-03-16 18:37:27,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1201] [2025-03-16 18:37:27,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2729] [2025-03-16 18:37:27,606 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3390] [2025-03-16 18:37:27,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product11.cil.c[71954,71967] [2025-03-16 18:37:27,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:37:27,720 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:37:27,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27 WrapperNode [2025-03-16 18:37:27,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:37:27,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:37:27,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:37:27,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:37:27,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,782 INFO L138 Inliner]: procedures = 93, calls = 335, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 1084 [2025-03-16 18:37:27,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:37:27,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:37:27,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:37:27,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:37:27,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,817 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-16 18:37:27,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:37:27,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:37:27,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:37:27,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:37:27,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (1/1) ... [2025-03-16 18:37:27,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:37:27,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:27,885 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-16 18:37:27,887 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-16 18:37:27,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:37:27,907 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:37:27,907 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:37:27,907 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:37:27,907 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:37:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2025-03-16 18:37:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2025-03-16 18:37:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:37:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:37:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:37:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:37:27,908 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:37:27,908 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:37:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:37:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:37:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:37:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:37:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:37:27,909 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:37:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:37:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:37:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:37:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:37:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-16 18:37:27,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-16 18:37:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:37:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2025-03-16 18:37:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:37:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:37:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:37:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:37:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-16 18:37:27,911 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:37:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:37:27,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:37:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:37:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:37:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:37:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:37:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:37:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:37:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:37:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:37:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:37:27,914 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:37:27,914 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:37:28,072 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:37:28,074 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:37:28,136 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1186: #res := ~retValue_acc~9; [2025-03-16 18:37:28,142 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280: #res := ~retValue_acc~10; [2025-03-16 18:37:28,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1433: #res := ~retValue_acc~11; [2025-03-16 18:37:28,218 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2089: #res#1 := ~retValue_acc~21#1; [2025-03-16 18:37:28,218 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-03-16 18:37:28,226 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2717: #res := ~retValue_acc~25; [2025-03-16 18:37:28,511 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970-1: stopRequestedInDirection__wrappee__empty_#res#1 := stopRequestedInDirection__wrappee__empty_~retValue_acc~18#1; [2025-03-16 18:37:28,511 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1999: #res#1 := ~retValue_acc~19#1; [2025-03-16 18:37:28,564 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2134: #res := ~retValue_acc~23; [2025-03-16 18:37:28,576 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1147: #res := ~retValue_acc~8; [2025-03-16 18:37:28,601 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1525: #res := ~retValue_acc~15; [2025-03-16 18:37:28,677 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-16 18:37:28,678 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-16 18:37:28,792 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-03-16 18:37:28,792 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-03-16 18:37:28,847 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3076: #res := ~retValue_acc~28; [2025-03-16 18:37:28,908 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L502-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-16 18:37:28,908 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1066-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-16 18:37:28,919 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2840: #res := ~retValue_acc~27; [2025-03-16 18:37:28,923 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3387: #res := ~retValue_acc~29; [2025-03-16 18:37:29,060 INFO L? ?]: Removed 437 outVars from TransFormulas that were not future-live. [2025-03-16 18:37:29,060 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:37:29,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:37:29,082 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:37:29,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:37:29 BoogieIcfgContainer [2025-03-16 18:37:29,082 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:37:29,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:37:29,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:37:29,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:37:29,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:37:27" (1/3) ... [2025-03-16 18:37:29,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cca07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:37:29, skipping insertion in model container [2025-03-16 18:37:29,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:37:27" (2/3) ... [2025-03-16 18:37:29,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65cca07f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:37:29, skipping insertion in model container [2025-03-16 18:37:29,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:37:29" (3/3) ... [2025-03-16 18:37:29,089 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2025-03-16 18:37:29,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:37:29,102 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product11.cil.c that has 24 procedures, 537 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:37:29,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:37:29,165 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;@79aa841c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:37:29,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:37:29,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 537 states, 421 states have (on average 1.7102137767220902) internal successors, (720), 442 states have internal predecessors, (720), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-16 18:37:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 18:37:29,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:29,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:29,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:29,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 222420524, now seen corresponding path program 1 times [2025-03-16 18:37:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:29,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999739488] [2025-03-16 18:37:29,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:29,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:29,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 18:37:29,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 18:37:29,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:29,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999739488] [2025-03-16 18:37:29,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999739488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:29,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:29,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:29,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457391941] [2025-03-16 18:37:29,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:29,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:29,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:29,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:29,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:29,674 INFO L87 Difference]: Start difference. First operand has 537 states, 421 states have (on average 1.7102137767220902) internal successors, (720), 442 states have internal predecessors, (720), 91 states have call successors, (91), 23 states have call predecessors, (91), 23 states have return successors, (91), 85 states have call predecessors, (91), 91 states have call successors, (91) Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:29,790 INFO L93 Difference]: Finished difference Result 1059 states and 1784 transitions. [2025-03-16 18:37:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2025-03-16 18:37:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:29,812 INFO L225 Difference]: With dead ends: 1059 [2025-03-16 18:37:29,812 INFO L226 Difference]: Without dead ends: 530 [2025-03-16 18:37:29,823 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-16 18:37:29,827 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 5 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2642 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-16 18:37:29,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2642 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-16 18:37:29,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-16 18:37:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.7067307692307692) internal successors, (710), 435 states have internal predecessors, (710), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 887 transitions. [2025-03-16 18:37:29,893 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 887 transitions. Word has length 99 [2025-03-16 18:37:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:29,893 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 887 transitions. [2025-03-16 18:37:29,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 887 transitions. [2025-03-16 18:37:29,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-16 18:37:29,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:29,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:29,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:37:29,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:29,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 694430324, now seen corresponding path program 1 times [2025-03-16 18:37:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728185972] [2025-03-16 18:37:29,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:29,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-16 18:37:29,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-16 18:37:29,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728185972] [2025-03-16 18:37:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728185972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797835464] [2025-03-16 18:37:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:30,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:30,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:30,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:30,100 INFO L87 Difference]: Start difference. First operand 530 states and 887 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:30,167 INFO L93 Difference]: Finished difference Result 1047 states and 1756 transitions. [2025-03-16 18:37:30,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:30,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-03-16 18:37:30,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:30,174 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 18:37:30,174 INFO L226 Difference]: Without dead ends: 530 [2025-03-16 18:37:30,177 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-16 18:37:30,177 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 4 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2624 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-16 18:37:30,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2624 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-16 18:37:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-16 18:37:30,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.7043269230769231) internal successors, (709), 435 states have internal predecessors, (709), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 886 transitions. [2025-03-16 18:37:30,221 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 886 transitions. Word has length 101 [2025-03-16 18:37:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:30,222 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 886 transitions. [2025-03-16 18:37:30,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,222 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 886 transitions. [2025-03-16 18:37:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:37:30,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:30,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:30,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:37:30,228 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:30,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -967942335, now seen corresponding path program 1 times [2025-03-16 18:37:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262651297] [2025-03-16 18:37:30,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:30,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:37:30,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:37:30,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:30,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:30,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:30,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262651297] [2025-03-16 18:37:30,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262651297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:30,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:30,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609593053] [2025-03-16 18:37:30,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:30,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:30,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:30,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:30,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:30,400 INFO L87 Difference]: Start difference. First operand 530 states and 886 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:30,456 INFO L93 Difference]: Finished difference Result 1047 states and 1755 transitions. [2025-03-16 18:37:30,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:30,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2025-03-16 18:37:30,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:30,462 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 18:37:30,462 INFO L226 Difference]: Without dead ends: 530 [2025-03-16 18:37:30,465 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-16 18:37:30,465 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 3 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2624 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-16 18:37:30,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2624 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:30,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-16 18:37:30,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-16 18:37:30,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.7019230769230769) internal successors, (708), 435 states have internal predecessors, (708), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 885 transitions. [2025-03-16 18:37:30,492 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 885 transitions. Word has length 102 [2025-03-16 18:37:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:30,493 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 885 transitions. [2025-03-16 18:37:30,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 885 transitions. [2025-03-16 18:37:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:37:30,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:30,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:30,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:37:30,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:30,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash 215333207, now seen corresponding path program 1 times [2025-03-16 18:37:30,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:30,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666861052] [2025-03-16 18:37:30,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:30,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:30,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-16 18:37:30,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:37:30,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:30,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:30,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666861052] [2025-03-16 18:37:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666861052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555901894] [2025-03-16 18:37:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:30,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:30,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:30,646 INFO L87 Difference]: Start difference. First operand 530 states and 885 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:30,686 INFO L93 Difference]: Finished difference Result 1047 states and 1754 transitions. [2025-03-16 18:37:30,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:30,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-03-16 18:37:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:30,691 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 18:37:30,691 INFO L226 Difference]: Without dead ends: 530 [2025-03-16 18:37:30,693 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-16 18:37:30,695 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 2 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2624 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-16 18:37:30,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2624 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-16 18:37:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-16 18:37:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.6995192307692308) internal successors, (707), 435 states have internal predecessors, (707), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 884 transitions. [2025-03-16 18:37:30,720 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 884 transitions. Word has length 103 [2025-03-16 18:37:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:30,720 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 884 transitions. [2025-03-16 18:37:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 884 transitions. [2025-03-16 18:37:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 18:37:30,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:30,724 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:37:30,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash -580610236, now seen corresponding path program 1 times [2025-03-16 18:37:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487995561] [2025-03-16 18:37:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 18:37:30,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 18:37:30,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:30,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:30,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:30,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:30,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487995561] [2025-03-16 18:37:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487995561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:30,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:30,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601864133] [2025-03-16 18:37:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:30,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:30,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:30,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:30,886 INFO L87 Difference]: Start difference. First operand 530 states and 884 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:30,918 INFO L93 Difference]: Finished difference Result 1047 states and 1753 transitions. [2025-03-16 18:37:30,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:30,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2025-03-16 18:37:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:30,923 INFO L225 Difference]: With dead ends: 1047 [2025-03-16 18:37:30,923 INFO L226 Difference]: Without dead ends: 530 [2025-03-16 18:37:30,925 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-16 18:37:30,927 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 1 mSDsluCounter, 1748 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2624 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-16 18:37:30,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2624 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-03-16 18:37:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2025-03-16 18:37:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 416 states have (on average 1.6971153846153846) internal successors, (706), 435 states have internal predecessors, (706), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 883 transitions. [2025-03-16 18:37:30,946 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 883 transitions. Word has length 104 [2025-03-16 18:37:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:30,946 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 883 transitions. [2025-03-16 18:37:30,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 883 transitions. [2025-03-16 18:37:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 18:37:30,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:30,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:30,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:37:30,949 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1692167226, now seen corresponding path program 1 times [2025-03-16 18:37:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:30,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199517950] [2025-03-16 18:37:30,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:30,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:30,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:37:30,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:37:30,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:30,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:31,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:31,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199517950] [2025-03-16 18:37:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199517950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:37:31,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395791970] [2025-03-16 18:37:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:31,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:37:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:31,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:37:31,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:31,172 INFO L87 Difference]: Start difference. First operand 530 states and 883 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:37:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:31,283 INFO L93 Difference]: Finished difference Result 1013 states and 1685 transitions. [2025-03-16 18:37:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:37:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2025-03-16 18:37:31,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:31,287 INFO L225 Difference]: With dead ends: 1013 [2025-03-16 18:37:31,287 INFO L226 Difference]: Without dead ends: 545 [2025-03-16 18:37:31,289 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-16 18:37:31,289 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 91 mSDsluCounter, 6014 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6885 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-16 18:37:31,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6885 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-16 18:37:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 543. [2025-03-16 18:37:31,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 426 states have (on average 1.692488262910798) internal successors, (721), 447 states have internal predecessors, (721), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (89), 85 states have call predecessors, (89), 87 states have call successors, (89) [2025-03-16 18:37:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 902 transitions. [2025-03-16 18:37:31,313 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 902 transitions. Word has length 105 [2025-03-16 18:37:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:31,314 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 902 transitions. [2025-03-16 18:37:31,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:37:31,315 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 902 transitions. [2025-03-16 18:37:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-16 18:37:31,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:31,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:31,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:37:31,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:31,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1250412731, now seen corresponding path program 1 times [2025-03-16 18:37:31,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:31,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008591294] [2025-03-16 18:37:31,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:31,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:31,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-16 18:37:31,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-16 18:37:31,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:31,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:31,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:31,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008591294] [2025-03-16 18:37:31,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008591294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:31,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:31,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:37:31,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928621961] [2025-03-16 18:37:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:31,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:37:31,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:31,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:37:31,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:37:31,407 INFO L87 Difference]: Start difference. First operand 543 states and 902 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:31,438 INFO L93 Difference]: Finished difference Result 1065 states and 1779 transitions. [2025-03-16 18:37:31,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:37:31,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2025-03-16 18:37:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:31,442 INFO L225 Difference]: With dead ends: 1065 [2025-03-16 18:37:31,442 INFO L226 Difference]: Without dead ends: 524 [2025-03-16 18:37:31,444 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-16 18:37:31,445 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 0 mSDsluCounter, 1749 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2626 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-16 18:37:31,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2626 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:31,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-16 18:37:31,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2025-03-16 18:37:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 410 states have (on average 1.6878048780487804) internal successors, (692), 429 states have internal predecessors, (692), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 869 transitions. [2025-03-16 18:37:31,483 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 869 transitions. Word has length 105 [2025-03-16 18:37:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:31,483 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 869 transitions. [2025-03-16 18:37:31,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 869 transitions. [2025-03-16 18:37:31,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 18:37:31,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:31,486 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:31,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:37:31,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:31,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash -318119974, now seen corresponding path program 1 times [2025-03-16 18:37:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:31,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862453071] [2025-03-16 18:37:31,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:31,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 18:37:31,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 18:37:31,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:31,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:31,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:31,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862453071] [2025-03-16 18:37:31,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862453071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:31,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:31,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:31,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746812729] [2025-03-16 18:37:31,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:31,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:31,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:31,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:31,608 INFO L87 Difference]: Start difference. First operand 524 states and 869 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:31,761 INFO L93 Difference]: Finished difference Result 1010 states and 1677 transitions. [2025-03-16 18:37:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:31,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-03-16 18:37:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:31,766 INFO L225 Difference]: With dead ends: 1010 [2025-03-16 18:37:31,766 INFO L226 Difference]: Without dead ends: 533 [2025-03-16 18:37:31,768 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-16 18:37:31,768 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 55 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4101 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-16 18:37:31,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4101 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-16 18:37:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2025-03-16 18:37:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 410 states have (on average 1.6780487804878048) internal successors, (688), 429 states have internal predecessors, (688), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:31,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 865 transitions. [2025-03-16 18:37:31,787 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 865 transitions. Word has length 106 [2025-03-16 18:37:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 865 transitions. [2025-03-16 18:37:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 865 transitions. [2025-03-16 18:37:31,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:37:31,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:31,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:31,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:37:31,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:31,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1899211005, now seen corresponding path program 1 times [2025-03-16 18:37:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580467210] [2025-03-16 18:37:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:31,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:37:31,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:37:31,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:31,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:31,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:31,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580467210] [2025-03-16 18:37:31,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580467210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:31,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:31,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:31,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796556540] [2025-03-16 18:37:31,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:31,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:31,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:31,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:31,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:31,914 INFO L87 Difference]: Start difference. First operand 524 states and 865 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:32,053 INFO L93 Difference]: Finished difference Result 1010 states and 1673 transitions. [2025-03-16 18:37:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-03-16 18:37:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:32,058 INFO L225 Difference]: With dead ends: 1010 [2025-03-16 18:37:32,058 INFO L226 Difference]: Without dead ends: 533 [2025-03-16 18:37:32,060 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-16 18:37:32,060 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 54 mSDsluCounter, 3275 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4101 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-16 18:37:32,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4101 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-16 18:37:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2025-03-16 18:37:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 410 states have (on average 1.6682926829268292) internal successors, (684), 429 states have internal predecessors, (684), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:32,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 861 transitions. [2025-03-16 18:37:32,078 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 861 transitions. Word has length 107 [2025-03-16 18:37:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:32,078 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 861 transitions. [2025-03-16 18:37:32,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 861 transitions. [2025-03-16 18:37:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:37:32,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:32,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:32,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:37:32,081 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:32,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:32,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1913920233, now seen corresponding path program 1 times [2025-03-16 18:37:32,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:32,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550748519] [2025-03-16 18:37:32,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:32,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:32,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 18:37:32,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:37:32,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:32,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:32,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:32,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550748519] [2025-03-16 18:37:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550748519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867312897] [2025-03-16 18:37:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:32,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:32,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:32,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:32,212 INFO L87 Difference]: Start difference. First operand 524 states and 861 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:32,342 INFO L93 Difference]: Finished difference Result 1010 states and 1669 transitions. [2025-03-16 18:37:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:32,343 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2025-03-16 18:37:32,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:32,347 INFO L225 Difference]: With dead ends: 1010 [2025-03-16 18:37:32,347 INFO L226 Difference]: Without dead ends: 533 [2025-03-16 18:37:32,349 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-16 18:37:32,350 INFO L435 NwaCegarLoop]: 825 mSDtfsCounter, 53 mSDsluCounter, 3258 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4083 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-16 18:37:32,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4083 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:32,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-16 18:37:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2025-03-16 18:37:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 410 states have (on average 1.6585365853658536) internal successors, (680), 429 states have internal predecessors, (680), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 857 transitions. [2025-03-16 18:37:32,373 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 857 transitions. Word has length 108 [2025-03-16 18:37:32,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:32,373 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 857 transitions. [2025-03-16 18:37:32,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 857 transitions. [2025-03-16 18:37:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-16 18:37:32,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:32,377 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:32,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:37:32,377 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:32,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash 371353928, now seen corresponding path program 1 times [2025-03-16 18:37:32,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:32,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279747196] [2025-03-16 18:37:32,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:32,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:32,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-16 18:37:32,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-16 18:37:32,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:32,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:32,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279747196] [2025-03-16 18:37:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279747196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:37:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506671021] [2025-03-16 18:37:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:32,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:37:32,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:32,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:37:32,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:32,505 INFO L87 Difference]: Start difference. First operand 524 states and 857 transitions. Second operand has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:37:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:32,558 INFO L93 Difference]: Finished difference Result 1001 states and 1651 transitions. [2025-03-16 18:37:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:37:32,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-03-16 18:37:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:32,562 INFO L225 Difference]: With dead ends: 1001 [2025-03-16 18:37:32,562 INFO L226 Difference]: Without dead ends: 503 [2025-03-16 18:37:32,564 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-16 18:37:32,564 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 84 mSDsluCounter, 4157 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5003 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-16 18:37:32,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5003 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-16 18:37:32,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-16 18:37:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 389 states have (on average 1.660668380462725) internal successors, (646), 408 states have internal predecessors, (646), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 823 transitions. [2025-03-16 18:37:32,579 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 823 transitions. Word has length 108 [2025-03-16 18:37:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:32,579 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 823 transitions. [2025-03-16 18:37:32,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:37:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 823 transitions. [2025-03-16 18:37:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 18:37:32,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:32,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:32,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:37:32,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:32,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -615433824, now seen corresponding path program 1 times [2025-03-16 18:37:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:32,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081428469] [2025-03-16 18:37:32,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:32,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:32,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 18:37:32,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 18:37:32,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:32,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:32,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:32,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081428469] [2025-03-16 18:37:32,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081428469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:32,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:32,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:32,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990555331] [2025-03-16 18:37:32,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:32,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:32,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:32,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:32,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:32,694 INFO L87 Difference]: Start difference. First operand 503 states and 823 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:32,755 INFO L93 Difference]: Finished difference Result 980 states and 1617 transitions. [2025-03-16 18:37:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:32,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2025-03-16 18:37:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:32,760 INFO L225 Difference]: With dead ends: 980 [2025-03-16 18:37:32,760 INFO L226 Difference]: Without dead ends: 503 [2025-03-16 18:37:32,780 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-16 18:37:32,781 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 17 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4021 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-16 18:37:32,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4021 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-16 18:37:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-16 18:37:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 389 states have (on average 1.6580976863753214) internal successors, (645), 408 states have internal predecessors, (645), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 822 transitions. [2025-03-16 18:37:32,795 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 822 transitions. Word has length 109 [2025-03-16 18:37:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:32,795 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 822 transitions. [2025-03-16 18:37:32,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 822 transitions. [2025-03-16 18:37:32,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 18:37:32,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:32,798 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:32,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:37:32,798 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:32,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1557555628, now seen corresponding path program 1 times [2025-03-16 18:37:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:32,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633950085] [2025-03-16 18:37:32,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:32,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 18:37:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 18:37:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:32,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633950085] [2025-03-16 18:37:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633950085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:32,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:32,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:32,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003784186] [2025-03-16 18:37:32,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:32,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:32,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:32,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:32,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:32,909 INFO L87 Difference]: Start difference. First operand 503 states and 822 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:32,972 INFO L93 Difference]: Finished difference Result 980 states and 1616 transitions. [2025-03-16 18:37:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:32,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-03-16 18:37:32,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:32,977 INFO L225 Difference]: With dead ends: 980 [2025-03-16 18:37:32,977 INFO L226 Difference]: Without dead ends: 503 [2025-03-16 18:37:32,979 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-16 18:37:32,979 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 16 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4021 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-16 18:37:32,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4021 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:32,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-16 18:37:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-16 18:37:32,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 389 states have (on average 1.6555269922879177) internal successors, (644), 408 states have internal predecessors, (644), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 821 transitions. [2025-03-16 18:37:32,995 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 821 transitions. Word has length 110 [2025-03-16 18:37:32,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:32,995 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 821 transitions. [2025-03-16 18:37:32,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:37:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 821 transitions. [2025-03-16 18:37:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 18:37:32,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:32,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:32,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:37:32,998 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:32,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1055911997, now seen corresponding path program 1 times [2025-03-16 18:37:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:32,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694116944] [2025-03-16 18:37:32,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:32,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:33,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 18:37:33,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 18:37:33,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:33,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:33,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:33,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694116944] [2025-03-16 18:37:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694116944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:37:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729466578] [2025-03-16 18:37:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:33,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:37:33,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:33,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:37:33,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:37:33,171 INFO L87 Difference]: Start difference. First operand 503 states and 821 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:37:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:33,262 INFO L93 Difference]: Finished difference Result 974 states and 1604 transitions. [2025-03-16 18:37:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:37:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-16 18:37:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:33,266 INFO L225 Difference]: With dead ends: 974 [2025-03-16 18:37:33,266 INFO L226 Difference]: Without dead ends: 503 [2025-03-16 18:37:33,268 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-16 18:37:33,268 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 6 mSDsluCounter, 6418 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7223 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-16 18:37:33,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7223 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:37:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-03-16 18:37:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 503. [2025-03-16 18:37:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 389 states have (on average 1.6529562982005142) internal successors, (643), 408 states have internal predecessors, (643), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:37:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 820 transitions. [2025-03-16 18:37:33,283 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 820 transitions. Word has length 111 [2025-03-16 18:37:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:33,284 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 820 transitions. [2025-03-16 18:37:33,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:37:33,284 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 820 transitions. [2025-03-16 18:37:33,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 18:37:33,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:33,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:33,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:37:33,287 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:33,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:33,287 INFO L85 PathProgramCache]: Analyzing trace with hash 2065424737, now seen corresponding path program 1 times [2025-03-16 18:37:33,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:33,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914708213] [2025-03-16 18:37:33,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:33,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:33,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 18:37:33,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 18:37:33,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:33,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:37:33,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914708213] [2025-03-16 18:37:33,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914708213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:37:33,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410386728] [2025-03-16 18:37:33,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:33,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:33,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:33,407 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:37:33,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:37:33,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 18:37:33,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 18:37:33,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:33,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:33,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1451 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:37:33,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:37:33,703 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:33,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:37:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410386728] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:33,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:37:33,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 18:37:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81207805] [2025-03-16 18:37:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:33,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:37:33,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:33,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:37:33,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:33,705 INFO L87 Difference]: Start difference. First operand 503 states and 820 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-16 18:37:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:33,746 INFO L93 Difference]: Finished difference Result 1420 states and 2367 transitions. [2025-03-16 18:37:33,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:37:33,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 112 [2025-03-16 18:37:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:33,753 INFO L225 Difference]: With dead ends: 1420 [2025-03-16 18:37:33,753 INFO L226 Difference]: Without dead ends: 957 [2025-03-16 18:37:33,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:33,755 INFO L435 NwaCegarLoop]: 935 mSDtfsCounter, 805 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:33,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1699 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:33,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2025-03-16 18:37:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 955. [2025-03-16 18:37:33,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 741 states have (on average 1.6720647773279351) internal successors, (1239), 774 states have internal predecessors, (1239), 172 states have call successors, (172), 41 states have call predecessors, (172), 41 states have return successors, (177), 165 states have call predecessors, (177), 167 states have call successors, (177) [2025-03-16 18:37:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1588 transitions. [2025-03-16 18:37:33,791 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1588 transitions. Word has length 112 [2025-03-16 18:37:33,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:33,792 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1588 transitions. [2025-03-16 18:37:33,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-16 18:37:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1588 transitions. [2025-03-16 18:37:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 18:37:33,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:33,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:33,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 18:37:33,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 18:37:33,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:33,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash -396502485, now seen corresponding path program 1 times [2025-03-16 18:37:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434382864] [2025-03-16 18:37:33,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:33,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 18:37:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 18:37:34,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:34,102 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:37:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434382864] [2025-03-16 18:37:34,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434382864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:37:34,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979552320] [2025-03-16 18:37:34,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:34,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:34,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:34,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:37:34,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:37:34,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 18:37:34,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 18:37:34,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:34,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:34,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:37:34,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:37:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:34,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:37:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979552320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:34,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:37:34,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 18:37:34,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270042436] [2025-03-16 18:37:34,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:34,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:37:34,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:34,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:37:34,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:34,402 INFO L87 Difference]: Start difference. First operand 955 states and 1588 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 18:37:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:34,462 INFO L93 Difference]: Finished difference Result 2778 states and 4689 transitions. [2025-03-16 18:37:34,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:37:34,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 113 [2025-03-16 18:37:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:34,475 INFO L225 Difference]: With dead ends: 2778 [2025-03-16 18:37:34,476 INFO L226 Difference]: Without dead ends: 1863 [2025-03-16 18:37:34,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:34,481 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 804 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:34,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1659 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:34,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-03-16 18:37:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1860. [2025-03-16 18:37:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1860 states, 1446 states have (on average 1.681881051175657) internal successors, (2432), 1507 states have internal predecessors, (2432), 334 states have call successors, (334), 77 states have call predecessors, (334), 79 states have return successors, (371), 327 states have call predecessors, (371), 329 states have call successors, (371) [2025-03-16 18:37:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3137 transitions. [2025-03-16 18:37:34,569 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3137 transitions. Word has length 113 [2025-03-16 18:37:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:34,569 INFO L471 AbstractCegarLoop]: Abstraction has 1860 states and 3137 transitions. [2025-03-16 18:37:34,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-16 18:37:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3137 transitions. [2025-03-16 18:37:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 18:37:34,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:34,572 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:34,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 18:37:34,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 18:37:34,774 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:34,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:34,774 INFO L85 PathProgramCache]: Analyzing trace with hash 593161179, now seen corresponding path program 1 times [2025-03-16 18:37:34,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:34,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517950718] [2025-03-16 18:37:34,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:34,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:34,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 18:37:34,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 18:37:34,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:34,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:37:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517950718] [2025-03-16 18:37:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517950718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:37:34,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847096917] [2025-03-16 18:37:34,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:34,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:34,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:34,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:37:34,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:37:34,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 18:37:35,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 18:37:35,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:35,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:35,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1455 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:37:35,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:37:35,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:35,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:37:35,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847096917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:35,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:37:35,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 18:37:35,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182194895] [2025-03-16 18:37:35,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:35,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:37:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:35,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:37:35,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:35,156 INFO L87 Difference]: Start difference. First operand 1860 states and 3137 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-16 18:37:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:35,258 INFO L93 Difference]: Finished difference Result 5495 states and 9387 transitions. [2025-03-16 18:37:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:37:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 114 [2025-03-16 18:37:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:35,284 INFO L225 Difference]: With dead ends: 5495 [2025-03-16 18:37:35,284 INFO L226 Difference]: Without dead ends: 3675 [2025-03-16 18:37:35,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:35,295 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 803 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:35,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1653 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:35,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2025-03-16 18:37:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 3671. [2025-03-16 18:37:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 2857 states have (on average 1.6863843192159609) internal successors, (4818), 2974 states have internal predecessors, (4818), 658 states have call successors, (658), 149 states have call predecessors, (658), 155 states have return successors, (795), 651 states have call predecessors, (795), 653 states have call successors, (795) [2025-03-16 18:37:35,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 6271 transitions. [2025-03-16 18:37:35,450 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 6271 transitions. Word has length 114 [2025-03-16 18:37:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:35,451 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 6271 transitions. [2025-03-16 18:37:35,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-16 18:37:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 6271 transitions. [2025-03-16 18:37:35,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 18:37:35,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:35,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:35,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 18:37:35,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:35,690 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1207959909, now seen corresponding path program 1 times [2025-03-16 18:37:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146219314] [2025-03-16 18:37:35,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:35,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 18:37:35,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 18:37:35,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:35,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:37:35,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146219314] [2025-03-16 18:37:35,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146219314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:37:35,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561252531] [2025-03-16 18:37:35,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:35,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:35,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:37:35,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:37:35,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 18:37:36,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 18:37:36,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:36,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:36,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:37:36,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:37:36,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:36,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:37:36,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561252531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:36,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:37:36,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 18:37:36,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769875195] [2025-03-16 18:37:36,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:36,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:37:36,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:36,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:37:36,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:36,075 INFO L87 Difference]: Start difference. First operand 3671 states and 6271 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 18:37:36,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:36,264 INFO L93 Difference]: Finished difference Result 10930 states and 18960 transitions. [2025-03-16 18:37:36,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:37:36,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 115 [2025-03-16 18:37:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:36,318 INFO L225 Difference]: With dead ends: 10930 [2025-03-16 18:37:36,318 INFO L226 Difference]: Without dead ends: 7299 [2025-03-16 18:37:36,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:36,342 INFO L435 NwaCegarLoop]: 911 mSDtfsCounter, 802 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:36,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1683 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:36,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7299 states. [2025-03-16 18:37:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7299 to 7294. [2025-03-16 18:37:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7294 states, 5680 states have (on average 1.6880281690140846) internal successors, (9588), 5909 states have internal predecessors, (9588), 1306 states have call successors, (1306), 293 states have call predecessors, (1306), 307 states have return successors, (1763), 1299 states have call predecessors, (1763), 1301 states have call successors, (1763) [2025-03-16 18:37:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7294 states to 7294 states and 12657 transitions. [2025-03-16 18:37:36,700 INFO L78 Accepts]: Start accepts. Automaton has 7294 states and 12657 transitions. Word has length 115 [2025-03-16 18:37:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:36,700 INFO L471 AbstractCegarLoop]: Abstraction has 7294 states and 12657 transitions. [2025-03-16 18:37:36,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 18:37:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7294 states and 12657 transitions. [2025-03-16 18:37:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 18:37:36,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:36,704 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:36,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 18:37:36,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 18:37:36,904 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:36,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:36,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1208119723, now seen corresponding path program 1 times [2025-03-16 18:37:36,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:36,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199072880] [2025-03-16 18:37:36,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:36,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:36,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 18:37:36,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 18:37:36,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:36,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:36,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 18:37:36,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199072880] [2025-03-16 18:37:36,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199072880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:37:36,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820064198] [2025-03-16 18:37:36,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:36,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:37:36,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:37:36,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:37:37,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 18:37:37,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 18:37:37,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:37,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:37,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1459 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:37:37,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:37:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:37:37,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:37:37,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820064198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:37,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:37:37,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 18:37:37,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864319518] [2025-03-16 18:37:37,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:37,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:37:37,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:37,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:37:37,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:37,267 INFO L87 Difference]: Start difference. First operand 7294 states and 12657 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-16 18:37:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:37,679 INFO L93 Difference]: Finished difference Result 21801 states and 38744 transitions. [2025-03-16 18:37:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:37:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 116 [2025-03-16 18:37:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:37,781 INFO L225 Difference]: With dead ends: 21801 [2025-03-16 18:37:37,781 INFO L226 Difference]: Without dead ends: 14539 [2025-03-16 18:37:37,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:37:37,822 INFO L435 NwaCegarLoop]: 930 mSDtfsCounter, 799 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:37,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1704 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:37,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14539 states. [2025-03-16 18:37:38,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14539 to 14533. [2025-03-16 18:37:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14533 states, 11320 states have (on average 1.6879858657243816) internal successors, (19108), 11773 states have internal predecessors, (19108), 2602 states have call successors, (2602), 581 states have call predecessors, (2602), 610 states have return successors, (4130), 2594 states have call predecessors, (4130), 2597 states have call successors, (4130) [2025-03-16 18:37:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 25840 transitions. [2025-03-16 18:37:38,451 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 25840 transitions. Word has length 116 [2025-03-16 18:37:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:38,452 INFO L471 AbstractCegarLoop]: Abstraction has 14533 states and 25840 transitions. [2025-03-16 18:37:38,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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-16 18:37:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 25840 transitions. [2025-03-16 18:37:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 18:37:38,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:38,475 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:38,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:37:38,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:37:38,676 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1975177120, now seen corresponding path program 1 times [2025-03-16 18:37:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246593413] [2025-03-16 18:37:38,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:38,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 18:37:38,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 18:37:38,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:38,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:38,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246593413] [2025-03-16 18:37:38,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246593413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:38,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:38,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:38,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277964928] [2025-03-16 18:37:38,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:38,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:38,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:38,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:38,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:38,793 INFO L87 Difference]: Start difference. First operand 14533 states and 25840 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:39,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:39,689 INFO L93 Difference]: Finished difference Result 29154 states and 53459 transitions. [2025-03-16 18:37:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:39,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 177 [2025-03-16 18:37:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:39,810 INFO L225 Difference]: With dead ends: 29154 [2025-03-16 18:37:39,810 INFO L226 Difference]: Without dead ends: 14661 [2025-03-16 18:37:39,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:39,902 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 819 mSDsluCounter, 2197 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 2999 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:39,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 2999 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:37:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14661 states. [2025-03-16 18:37:40,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14661 to 14661. [2025-03-16 18:37:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14661 states, 11416 states have (on average 1.6822004204625087) internal successors, (19204), 11869 states have internal predecessors, (19204), 2602 states have call successors, (2602), 613 states have call predecessors, (2602), 642 states have return successors, (4162), 2594 states have call predecessors, (4162), 2597 states have call successors, (4162) [2025-03-16 18:37:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14661 states to 14661 states and 25968 transitions. [2025-03-16 18:37:40,635 INFO L78 Accepts]: Start accepts. Automaton has 14661 states and 25968 transitions. Word has length 177 [2025-03-16 18:37:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 14661 states and 25968 transitions. [2025-03-16 18:37:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 14661 states and 25968 transitions. [2025-03-16 18:37:40,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 18:37:40,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:40,654 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:40,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:37:40,655 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:40,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:40,655 INFO L85 PathProgramCache]: Analyzing trace with hash -775951300, now seen corresponding path program 1 times [2025-03-16 18:37:40,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:40,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281763175] [2025-03-16 18:37:40,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:40,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 18:37:40,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 18:37:40,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:40,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:40,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:40,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281763175] [2025-03-16 18:37:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281763175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:40,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:40,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282052088] [2025-03-16 18:37:40,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:40,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:40,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:40,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:40,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:40,761 INFO L87 Difference]: Start difference. First operand 14661 states and 25968 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:41,486 INFO L93 Difference]: Finished difference Result 29442 states and 53683 transitions. [2025-03-16 18:37:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:41,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 178 [2025-03-16 18:37:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:41,692 INFO L225 Difference]: With dead ends: 29442 [2025-03-16 18:37:41,692 INFO L226 Difference]: Without dead ends: 14821 [2025-03-16 18:37:41,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:41,740 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 818 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:41,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3005 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:37:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14821 states. [2025-03-16 18:37:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14821 to 14821. [2025-03-16 18:37:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14821 states, 11544 states have (on average 1.6746361746361746) internal successors, (19332), 11997 states have internal predecessors, (19332), 2602 states have call successors, (2602), 645 states have call predecessors, (2602), 674 states have return successors, (4194), 2594 states have call predecessors, (4194), 2597 states have call successors, (4194) [2025-03-16 18:37:42,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14821 states to 14821 states and 26128 transitions. [2025-03-16 18:37:42,194 INFO L78 Accepts]: Start accepts. Automaton has 14821 states and 26128 transitions. Word has length 178 [2025-03-16 18:37:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:42,194 INFO L471 AbstractCegarLoop]: Abstraction has 14821 states and 26128 transitions. [2025-03-16 18:37:42,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 14821 states and 26128 transitions. [2025-03-16 18:37:42,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-16 18:37:42,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:42,214 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:42,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:37:42,214 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:42,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 174415203, now seen corresponding path program 1 times [2025-03-16 18:37:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74397086] [2025-03-16 18:37:42,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:42,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-16 18:37:42,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-16 18:37:42,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:42,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74397086] [2025-03-16 18:37:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74397086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:42,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507192511] [2025-03-16 18:37:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:42,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:42,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:42,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:42,331 INFO L87 Difference]: Start difference. First operand 14821 states and 26128 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:43,063 INFO L93 Difference]: Finished difference Result 29794 states and 53971 transitions. [2025-03-16 18:37:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:43,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 179 [2025-03-16 18:37:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:43,188 INFO L225 Difference]: With dead ends: 29794 [2025-03-16 18:37:43,188 INFO L226 Difference]: Without dead ends: 15013 [2025-03-16 18:37:43,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:43,268 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 818 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:43,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3005 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:37:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15013 states. [2025-03-16 18:37:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15013 to 15013. [2025-03-16 18:37:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15013 states, 11704 states have (on average 1.6654135338345866) internal successors, (19492), 12157 states have internal predecessors, (19492), 2602 states have call successors, (2602), 677 states have call predecessors, (2602), 706 states have return successors, (4226), 2594 states have call predecessors, (4226), 2597 states have call successors, (4226) [2025-03-16 18:37:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15013 states to 15013 states and 26320 transitions. [2025-03-16 18:37:43,972 INFO L78 Accepts]: Start accepts. Automaton has 15013 states and 26320 transitions. Word has length 179 [2025-03-16 18:37:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 15013 states and 26320 transitions. [2025-03-16 18:37:43,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 15013 states and 26320 transitions. [2025-03-16 18:37:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 18:37:43,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:43,993 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:43,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 18:37:43,993 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:43,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:43,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2000077471, now seen corresponding path program 1 times [2025-03-16 18:37:43,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:43,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586124537] [2025-03-16 18:37:43,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:44,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 18:37:44,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 18:37:44,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:44,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:44,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586124537] [2025-03-16 18:37:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586124537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:44,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466672395] [2025-03-16 18:37:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:44,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:44,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:44,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:44,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:44,139 INFO L87 Difference]: Start difference. First operand 15013 states and 26320 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:45,009 INFO L93 Difference]: Finished difference Result 30210 states and 54323 transitions. [2025-03-16 18:37:45,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:45,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 180 [2025-03-16 18:37:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:45,145 INFO L225 Difference]: With dead ends: 30210 [2025-03-16 18:37:45,145 INFO L226 Difference]: Without dead ends: 15237 [2025-03-16 18:37:45,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:45,239 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 818 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:45,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 3005 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:37:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15237 states. [2025-03-16 18:37:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15237 to 15237. [2025-03-16 18:37:45,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15237 states, 11896 states have (on average 1.6546738399462004) internal successors, (19684), 12349 states have internal predecessors, (19684), 2602 states have call successors, (2602), 709 states have call predecessors, (2602), 738 states have return successors, (4258), 2594 states have call predecessors, (4258), 2597 states have call successors, (4258) [2025-03-16 18:37:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15237 states to 15237 states and 26544 transitions. [2025-03-16 18:37:45,848 INFO L78 Accepts]: Start accepts. Automaton has 15237 states and 26544 transitions. Word has length 180 [2025-03-16 18:37:45,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:45,849 INFO L471 AbstractCegarLoop]: Abstraction has 15237 states and 26544 transitions. [2025-03-16 18:37:45,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 15237 states and 26544 transitions. [2025-03-16 18:37:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 18:37:45,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:45,862 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:45,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 18:37:45,862 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:45,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:45,863 INFO L85 PathProgramCache]: Analyzing trace with hash 797030892, now seen corresponding path program 1 times [2025-03-16 18:37:45,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:45,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41947603] [2025-03-16 18:37:45,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:45,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 18:37:45,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 18:37:45,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:45,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:45,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41947603] [2025-03-16 18:37:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41947603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:37:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997629251] [2025-03-16 18:37:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:45,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:37:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:45,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:37:45,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:37:45,960 INFO L87 Difference]: Start difference. First operand 15237 states and 26544 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:46,682 INFO L93 Difference]: Finished difference Result 30498 states and 54387 transitions. [2025-03-16 18:37:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:37:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) Word has length 181 [2025-03-16 18:37:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:46,795 INFO L225 Difference]: With dead ends: 30498 [2025-03-16 18:37:46,795 INFO L226 Difference]: Without dead ends: 15301 [2025-03-16 18:37:46,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:46,866 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 809 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:46,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2972 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:37:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15301 states. [2025-03-16 18:37:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15301 to 15301. [2025-03-16 18:37:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15301 states, 11928 states have (on average 1.652917505030181) internal successors, (19716), 12413 states have internal predecessors, (19716), 2602 states have call successors, (2602), 709 states have call predecessors, (2602), 770 states have return successors, (4290), 2594 states have call predecessors, (4290), 2597 states have call successors, (4290) [2025-03-16 18:37:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 26608 transitions. [2025-03-16 18:37:47,310 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 26608 transitions. Word has length 181 [2025-03-16 18:37:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:47,311 INFO L471 AbstractCegarLoop]: Abstraction has 15301 states and 26608 transitions. [2025-03-16 18:37:47,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 4 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (22), 4 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 26608 transitions. [2025-03-16 18:37:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 18:37:47,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:47,323 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:47,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 18:37:47,324 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:47,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:47,324 INFO L85 PathProgramCache]: Analyzing trace with hash 895137382, now seen corresponding path program 1 times [2025-03-16 18:37:47,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696267868] [2025-03-16 18:37:47,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:47,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 18:37:47,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 18:37:47,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:47,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:47,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:47,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696267868] [2025-03-16 18:37:47,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696267868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:47,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:47,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:37:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185551107] [2025-03-16 18:37:47,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:37:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:47,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:37:47,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:37:47,606 INFO L87 Difference]: Start difference. First operand 15301 states and 26608 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 8 states have internal predecessors, (111), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-16 18:37:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:51,888 INFO L93 Difference]: Finished difference Result 49152 states and 91043 transitions. [2025-03-16 18:37:51,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 18:37:51,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 8 states have internal predecessors, (111), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) Word has length 181 [2025-03-16 18:37:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:52,255 INFO L225 Difference]: With dead ends: 49152 [2025-03-16 18:37:52,255 INFO L226 Difference]: Without dead ends: 33881 [2025-03-16 18:37:52,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-03-16 18:37:52,406 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 2571 mSDsluCounter, 3704 mSDsCounter, 0 mSdLazyCounter, 7905 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 4493 SdHoareTripleChecker+Invalid, 8710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 7905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:52,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2573 Valid, 4493 Invalid, 8710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 7905 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 18:37:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33881 states. [2025-03-16 18:37:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33881 to 33724. [2025-03-16 18:37:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33724 states, 25768 states have (on average 1.6398245886370693) internal successors, (42255), 26924 states have internal predecessors, (42255), 6318 states have call successors, (6318), 1417 states have call predecessors, (6318), 1637 states have return successors, (12548), 6374 states have call predecessors, (12548), 6313 states have call successors, (12548) [2025-03-16 18:37:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33724 states to 33724 states and 61121 transitions. [2025-03-16 18:37:54,434 INFO L78 Accepts]: Start accepts. Automaton has 33724 states and 61121 transitions. Word has length 181 [2025-03-16 18:37:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:54,434 INFO L471 AbstractCegarLoop]: Abstraction has 33724 states and 61121 transitions. [2025-03-16 18:37:54,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 8 states have internal predecessors, (111), 5 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-16 18:37:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33724 states and 61121 transitions. [2025-03-16 18:37:54,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 18:37:54,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:54,473 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:54,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 18:37:54,474 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1435845557, now seen corresponding path program 1 times [2025-03-16 18:37:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:54,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942752624] [2025-03-16 18:37:54,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:54,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 18:37:54,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 18:37:54,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:54,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 18:37:54,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942752624] [2025-03-16 18:37:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942752624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:37:54,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853819407] [2025-03-16 18:37:54,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:54,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:37:54,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:54,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:37:54,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:37:54,662 INFO L87 Difference]: Start difference. First operand 33724 states and 61121 transitions. Second operand has 8 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:55,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:55,463 INFO L93 Difference]: Finished difference Result 48833 states and 87404 transitions. [2025-03-16 18:37:55,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 18:37:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 188 [2025-03-16 18:37:55,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:55,561 INFO L225 Difference]: With dead ends: 48833 [2025-03-16 18:37:55,561 INFO L226 Difference]: Without dead ends: 15138 [2025-03-16 18:37:55,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:55,690 INFO L435 NwaCegarLoop]: 800 mSDtfsCounter, 8 mSDsluCounter, 4777 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 5577 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:55,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 5577 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:37:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-03-16 18:37:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15138. [2025-03-16 18:37:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 11829 states have (on average 1.6526333586947333) internal successors, (19549), 12314 states have internal predecessors, (19549), 2538 states have call successors, (2538), 709 states have call predecessors, (2538), 770 states have return successors, (4226), 2530 states have call predecessors, (4226), 2533 states have call successors, (4226) [2025-03-16 18:37:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 26313 transitions. [2025-03-16 18:37:56,291 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 26313 transitions. Word has length 188 [2025-03-16 18:37:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:56,291 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 26313 transitions. [2025-03-16 18:37:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 17.0) internal successors, (119), 7 states have internal predecessors, (119), 3 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2025-03-16 18:37:56,291 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 26313 transitions. [2025-03-16 18:37:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 18:37:56,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:56,301 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:56,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 18:37:56,302 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:56,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:56,302 INFO L85 PathProgramCache]: Analyzing trace with hash 56507038, now seen corresponding path program 1 times [2025-03-16 18:37:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756168145] [2025-03-16 18:37:56,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:56,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:56,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 18:37:56,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 18:37:56,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:56,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 18:37:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756168145] [2025-03-16 18:37:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756168145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:56,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:56,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:37:56,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442895762] [2025-03-16 18:37:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:56,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:37:56,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:56,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:37:56,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:37:56,502 INFO L87 Difference]: Start difference. First operand 15138 states and 26313 transitions. Second operand has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 states have internal predecessors, (116), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:37:58,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:37:58,002 INFO L93 Difference]: Finished difference Result 30303 states and 53740 transitions. [2025-03-16 18:37:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:37:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 states have internal predecessors, (116), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 187 [2025-03-16 18:37:58,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:37:58,224 INFO L225 Difference]: With dead ends: 30303 [2025-03-16 18:37:58,224 INFO L226 Difference]: Without dead ends: 15202 [2025-03-16 18:37:58,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-16 18:37:58,270 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 1236 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 3153 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 3488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 3153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:37:58,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1684 Invalid, 3488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 3153 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:37:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15202 states. [2025-03-16 18:37:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15202 to 15202. [2025-03-16 18:37:58,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15202 states, 11893 states have (on average 1.6491213318758935) internal successors, (19613), 12346 states have internal predecessors, (19613), 2538 states have call successors, (2538), 709 states have call predecessors, (2538), 770 states have return successors, (4226), 2562 states have call predecessors, (4226), 2533 states have call successors, (4226) [2025-03-16 18:37:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15202 states to 15202 states and 26377 transitions. [2025-03-16 18:37:58,850 INFO L78 Accepts]: Start accepts. Automaton has 15202 states and 26377 transitions. Word has length 187 [2025-03-16 18:37:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:37:58,850 INFO L471 AbstractCegarLoop]: Abstraction has 15202 states and 26377 transitions. [2025-03-16 18:37:58,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.88888888888889) internal successors, (116), 8 states have internal predecessors, (116), 5 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:37:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 15202 states and 26377 transitions. [2025-03-16 18:37:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-16 18:37:58,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:37:58,861 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:37:58,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 18:37:58,861 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:37:58,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:37:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash 700429824, now seen corresponding path program 1 times [2025-03-16 18:37:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:37:58,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258646500] [2025-03-16 18:37:58,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:37:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:37:58,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-16 18:37:58,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-16 18:37:58,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:37:58,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:37:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-16 18:37:58,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:37:58,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258646500] [2025-03-16 18:37:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258646500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:37:58,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:37:58,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:37:58,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010044878] [2025-03-16 18:37:58,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:37:58,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:37:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:37:58,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:37:58,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:37:58,985 INFO L87 Difference]: Start difference. First operand 15202 states and 26377 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:38:02,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:38:02,195 INFO L93 Difference]: Finished difference Result 59770 states and 108150 transitions. [2025-03-16 18:38:02,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 18:38:02,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 188 [2025-03-16 18:38:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:38:02,667 INFO L225 Difference]: With dead ends: 59770 [2025-03-16 18:38:02,667 INFO L226 Difference]: Without dead ends: 44541 [2025-03-16 18:38:02,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 18:38:02,768 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 3301 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 891 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3371 SdHoareTripleChecker+Valid, 2160 SdHoareTripleChecker+Invalid, 5682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 18:38:02,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3371 Valid, 2160 Invalid, 5682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 18:38:02,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44541 states. [2025-03-16 18:38:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44541 to 44201. [2025-03-16 18:38:04,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44201 states, 34495 states have (on average 1.6170749383968692) internal successors, (55781), 35843 states have internal predecessors, (55781), 7400 states have call successors, (7400), 2213 states have call predecessors, (7400), 2305 states have return successors, (14720), 7297 states have call predecessors, (14720), 7395 states have call successors, (14720) [2025-03-16 18:38:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44201 states to 44201 states and 77901 transitions. [2025-03-16 18:38:04,945 INFO L78 Accepts]: Start accepts. Automaton has 44201 states and 77901 transitions. Word has length 188 [2025-03-16 18:38:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:38:04,945 INFO L471 AbstractCegarLoop]: Abstraction has 44201 states and 77901 transitions. [2025-03-16 18:38:04,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 5 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:38:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44201 states and 77901 transitions. [2025-03-16 18:38:04,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-16 18:38:04,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:38:04,956 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:38:04,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 18:38:04,956 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:38:04,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:38:04,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1059044824, now seen corresponding path program 1 times [2025-03-16 18:38:04,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:38:04,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7245236] [2025-03-16 18:38:04,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:38:04,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:38:04,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-16 18:38:04,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-16 18:38:04,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:38:04,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:38:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-16 18:38:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:38:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7245236] [2025-03-16 18:38:05,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7245236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:38:05,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:38:05,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:38:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200488387] [2025-03-16 18:38:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:38:05,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:38:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:38:05,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:38:05,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:38:05,105 INFO L87 Difference]: Start difference. First operand 44201 states and 77901 transitions. Second operand has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 5 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-16 18:38:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:38:14,152 INFO L93 Difference]: Finished difference Result 160334 states and 339146 transitions. [2025-03-16 18:38:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:38:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.75) internal successors, (118), 8 states have internal predecessors, (118), 5 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 190 [2025-03-16 18:38:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:38:15,611 INFO L225 Difference]: With dead ends: 160334 [2025-03-16 18:38:15,611 INFO L226 Difference]: Without dead ends: 116170 [2025-03-16 18:38:16,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-16 18:38:16,083 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 3148 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 6015 mSolverCounterSat, 919 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3182 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 6934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 919 IncrementalHoareTripleChecker+Valid, 6015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:38:16,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3182 Valid, 3145 Invalid, 6934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [919 Valid, 6015 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 18:38:16,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116170 states.