./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:36:09,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:36:09,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:36:09,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:36:09,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:36:09,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:36:09,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:36:09,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:36:09,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:36:09,257 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:36:09,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:36:09,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:36:09,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:36:09,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:36:09,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:36:09,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:36:09,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:36:09,261 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:36:09,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:36:09,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:36:09,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:36:09,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:36:09,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:36:09,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:36:09,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:36:09,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:09,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:36:09,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:36:09,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:36:09,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:36:09,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:36:09,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:36:09,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:36:09,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:36:09,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:36:09,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:36:09,263 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-jdk21/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 -> 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec [2025-02-05 15:36:09,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:36:09,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:36:09,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:36:09,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:36:09,463 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:36:09,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-02-05 15:36:10,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf8ad045/76645a98bb004d85932cb4984f5e3620/FLAG95515d89e [2025-02-05 15:36:11,066 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:36:11,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-02-05 15:36:11,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf8ad045/76645a98bb004d85932cb4984f5e3620/FLAG95515d89e [2025-02-05 15:36:11,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eaf8ad045/76645a98bb004d85932cb4984f5e3620 [2025-02-05 15:36:11,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:36:11,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:36:11,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:11,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:36:11,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:36:11,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6633ec0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11, skipping insertion in model container [2025-02-05 15:36:11,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:36:11,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c[66231,66244] [2025-02-05 15:36:11,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:11,537 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:36:11,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:36:11,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [86] [2025-02-05 15:36:11,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [100] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [286] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1765] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1884] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2546] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2638] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2025-02-05 15:36:11,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3013] [2025-02-05 15:36:11,618 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c[66231,66244] [2025-02-05 15:36:11,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:36:11,643 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:36:11,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11 WrapperNode [2025-02-05 15:36:11,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:36:11,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:11,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:36:11,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:36:11,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,706 INFO L138 Inliner]: procedures = 91, calls = 334, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 842 [2025-02-05 15:36:11,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:36:11,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:36:11,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:36:11,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:36:11,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,748 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:36:11,751 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,768 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:36:11,779 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:36:11,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:36:11,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:36:11,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (1/1) ... [2025-02-05 15:36:11,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:36:11,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:11,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:36:11,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:36:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:36:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:36:11,824 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:36:11,824 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-02-05 15:36:11,825 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-02-05 15:36:11,825 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:36:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:36:11,826 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:36:11,827 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:36:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:36:11,828 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:36:11,828 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:36:11,828 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:36:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:36:11,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:36:11,829 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:36:11,829 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:36:11,939 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:36:11,940 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:36:11,977 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: #res := ~retValue_acc~17; [2025-02-05 15:36:11,992 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: #res := ~retValue_acc~15; [2025-02-05 15:36:11,994 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: #res := ~retValue_acc~2; [2025-02-05 15:36:12,280 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: #res := ~retValue_acc~10; [2025-02-05 15:36:12,329 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1190: #res := ~retValue_acc~13; [2025-02-05 15:36:12,342 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1842: #res := ~retValue_acc~16; [2025-02-05 15:36:12,405 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L641-1: isEmpty_#res#1 := isEmpty_~retValue_acc~7#1; [2025-02-05 15:36:12,519 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1176-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-02-05 15:36:12,519 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~3#1; [2025-02-05 15:36:12,520 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L592-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~5#1; [2025-02-05 15:36:12,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~8#1; [2025-02-05 15:36:12,639 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: isIdle_#res#1 := isIdle_~retValue_acc~9#1; [2025-02-05 15:36:12,772 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: #res := ~retValue_acc~19; [2025-02-05 15:36:12,867 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:36:12,868 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3360-1: main_#res#1 := main_~retValue_acc~25#1; [2025-02-05 15:36:12,878 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: #res := ~retValue_acc~18; [2025-02-05 15:36:12,880 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: #res := ~retValue_acc~4; [2025-02-05 15:36:12,886 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~20; [2025-02-05 15:36:13,005 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-02-05 15:36:13,005 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:36:13,028 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:36:13,031 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:36:13,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:13 BoogieIcfgContainer [2025-02-05 15:36:13,032 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:36:13,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:36:13,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:36:13,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:36:13,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:36:11" (1/3) ... [2025-02-05 15:36:13,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ca78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:13, skipping insertion in model container [2025-02-05 15:36:13,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:36:11" (2/3) ... [2025-02-05 15:36:13,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ca78c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:36:13, skipping insertion in model container [2025-02-05 15:36:13,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:36:13" (3/3) ... [2025-02-05 15:36:13,041 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2025-02-05 15:36:13,056 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:36:13,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product25.cil.c that has 22 procedures, 541 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:36:13,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:36:13,124 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;@669db315, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:36:13,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:36:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 541 states, 429 states have (on average 1.710955710955711) internal successors, (734), 451 states have internal predecessors, (734), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) [2025-02-05 15:36:13,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 15:36:13,159 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:13,160 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:13,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2149856, now seen corresponding path program 1 times [2025-02-05 15:36:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173806493] [2025-02-05 15:36:13,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:13,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 15:36:13,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 15:36:13,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:13,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:13,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:13,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173806493] [2025-02-05 15:36:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173806493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:13,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801266238] [2025-02-05 15:36:13,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:13,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:13,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:13,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:13,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:13,682 INFO L87 Difference]: Start difference. First operand has 541 states, 429 states have (on average 1.710955710955711) internal successors, (734), 451 states have internal predecessors, (734), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 82 states have call predecessors, (88), 88 states have call successors, (88) 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:13,816 INFO L93 Difference]: Finished difference Result 1062 states and 1794 transitions. [2025-02-05 15:36:13,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:13,818 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 92 [2025-02-05 15:36:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:13,833 INFO L225 Difference]: With dead ends: 1062 [2025-02-05 15:36:13,833 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:36:13,841 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-02-05 15:36:13,843 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 5 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2666 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-02-05 15:36:13,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2666 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:13,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:36:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:36:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.7044917257683214) internal successors, (721), 442 states have internal predecessors, (721), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 892 transitions. [2025-02-05 15:36:13,913 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 892 transitions. Word has length 92 [2025-02-05 15:36:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:13,914 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 892 transitions. [2025-02-05 15:36:13,915 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, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 892 transitions. [2025-02-05 15:36:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:36:13,924 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:13,925 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:13,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:36:13,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:13,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:13,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1625912477, now seen corresponding path program 1 times [2025-02-05 15:36:13,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:13,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606494459] [2025-02-05 15:36:13,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:13,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:13,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:36:13,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:36:13,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606494459] [2025-02-05 15:36:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606494459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:14,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929101696] [2025-02-05 15:36:14,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:14,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:14,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:14,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:14,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:14,137 INFO L87 Difference]: Start difference. First operand 532 states and 892 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:14,207 INFO L93 Difference]: Finished difference Result 1046 states and 1761 transitions. [2025-02-05 15:36:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:14,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2025-02-05 15:36:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:14,216 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:36:14,216 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:36:14,218 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-02-05 15:36:14,220 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 4 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2639 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-02-05 15:36:14,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2639 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:36:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:36:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.702127659574468) internal successors, (720), 442 states have internal predecessors, (720), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 891 transitions. [2025-02-05 15:36:14,281 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 891 transitions. Word has length 93 [2025-02-05 15:36:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:14,281 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 891 transitions. [2025-02-05 15:36:14,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 891 transitions. [2025-02-05 15:36:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:36:14,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:14,284 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:14,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:36:14,285 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:14,285 INFO L85 PathProgramCache]: Analyzing trace with hash -69650403, now seen corresponding path program 1 times [2025-02-05 15:36:14,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:14,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228435440] [2025-02-05 15:36:14,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:14,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:36:14,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:36:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:14,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228435440] [2025-02-05 15:36:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228435440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:14,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765788870] [2025-02-05 15:36:14,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:14,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:14,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:14,381 INFO L87 Difference]: Start difference. First operand 532 states and 891 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:14,431 INFO L93 Difference]: Finished difference Result 1046 states and 1760 transitions. [2025-02-05 15:36:14,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:14,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 94 [2025-02-05 15:36:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:14,437 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:36:14,438 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:36:14,440 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-02-05 15:36:14,441 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 3 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2639 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-02-05 15:36:14,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2639 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:14,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:36:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:36:14,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 442 states have internal predecessors, (719), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 890 transitions. [2025-02-05 15:36:14,465 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 890 transitions. Word has length 94 [2025-02-05 15:36:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:14,466 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 890 transitions. [2025-02-05 15:36:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 890 transitions. [2025-02-05 15:36:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:36:14,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:14,470 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:14,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:36:14,471 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:14,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:14,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1416420480, now seen corresponding path program 1 times [2025-02-05 15:36:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:14,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177070204] [2025-02-05 15:36:14,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:14,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 15:36:14,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:36:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:14,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:14,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177070204] [2025-02-05 15:36:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177070204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:14,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:14,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:14,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706020103] [2025-02-05 15:36:14,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:14,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:14,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:14,614 INFO L87 Difference]: Start difference. First operand 532 states and 890 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:14,661 INFO L93 Difference]: Finished difference Result 1046 states and 1759 transitions. [2025-02-05 15:36:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 95 [2025-02-05 15:36:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:14,666 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:36:14,666 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:36:14,668 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-02-05 15:36:14,669 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 2 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2639 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-02-05 15:36:14,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2639 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:36:14,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:36:14,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.6973995271867612) internal successors, (718), 442 states have internal predecessors, (718), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 889 transitions. [2025-02-05 15:36:14,693 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 889 transitions. Word has length 95 [2025-02-05 15:36:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:14,694 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 889 transitions. [2025-02-05 15:36:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 889 transitions. [2025-02-05 15:36:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 15:36:14,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:14,698 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:14,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:36:14,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:14,699 INFO L85 PathProgramCache]: Analyzing trace with hash 726564442, now seen corresponding path program 1 times [2025-02-05 15:36:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712026642] [2025-02-05 15:36:14,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:14,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:14,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 15:36:14,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 15:36:14,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:14,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:14,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:14,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:14,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712026642] [2025-02-05 15:36:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712026642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973146704] [2025-02-05 15:36:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:14,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:14,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:14,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:14,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:14,819 INFO L87 Difference]: Start difference. First operand 532 states and 889 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:14,853 INFO L93 Difference]: Finished difference Result 1046 states and 1758 transitions. [2025-02-05 15:36:14,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2025-02-05 15:36:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:14,857 INFO L225 Difference]: With dead ends: 1046 [2025-02-05 15:36:14,857 INFO L226 Difference]: Without dead ends: 532 [2025-02-05 15:36:14,860 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-02-05 15:36:14,861 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 1 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2639 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-02-05 15:36:14,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2639 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-05 15:36:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-05 15:36:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 423 states have (on average 1.6950354609929077) internal successors, (717), 442 states have internal predecessors, (717), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:14,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 888 transitions. [2025-02-05 15:36:14,880 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 888 transitions. Word has length 96 [2025-02-05 15:36:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:14,880 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 888 transitions. [2025-02-05 15:36:14,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:14,880 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 888 transitions. [2025-02-05 15:36:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:36:14,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:14,882 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:36:14,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:14,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1302450589, now seen corresponding path program 1 times [2025-02-05 15:36:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:14,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938547003] [2025-02-05 15:36:14,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:14,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:14,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:36:14,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:36:14,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:14,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:15,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938547003] [2025-02-05 15:36:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938547003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:15,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 15:36:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065982387] [2025-02-05 15:36:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:15,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 15:36:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:15,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 15:36:15,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:15,121 INFO L87 Difference]: Start difference. First operand 532 states and 888 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:36:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:15,237 INFO L93 Difference]: Finished difference Result 1012 states and 1690 transitions. [2025-02-05 15:36:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:36:15,238 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2025-02-05 15:36:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:15,242 INFO L225 Difference]: With dead ends: 1012 [2025-02-05 15:36:15,242 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 15:36:15,244 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-02-05 15:36:15,245 INFO L435 NwaCegarLoop]: 876 mSDtfsCounter, 91 mSDsluCounter, 6049 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6925 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-02-05 15:36:15,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6925 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 15:36:15,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2025-02-05 15:36:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 433 states have (on average 1.6905311778290992) internal successors, (732), 454 states have internal predecessors, (732), 89 states have call successors, (89), 21 states have call predecessors, (89), 22 states have return successors, (86), 82 states have call predecessors, (86), 84 states have call successors, (86) [2025-02-05 15:36:15,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 907 transitions. [2025-02-05 15:36:15,270 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 907 transitions. Word has length 97 [2025-02-05 15:36:15,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:15,271 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 907 transitions. [2025-02-05 15:36:15,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:36:15,271 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 907 transitions. [2025-02-05 15:36:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:36:15,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:15,275 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:15,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:36:15,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:15,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:15,276 INFO L85 PathProgramCache]: Analyzing trace with hash 731199356, now seen corresponding path program 1 times [2025-02-05 15:36:15,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:15,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261577645] [2025-02-05 15:36:15,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:15,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:15,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:36:15,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:36:15,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:15,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:15,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261577645] [2025-02-05 15:36:15,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261577645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:15,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:15,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:15,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934862242] [2025-02-05 15:36:15,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:15,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:15,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:15,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:15,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:15,363 INFO L87 Difference]: Start difference. First operand 545 states and 907 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:15,397 INFO L93 Difference]: Finished difference Result 1064 states and 1784 transitions. [2025-02-05 15:36:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 97 [2025-02-05 15:36:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:15,401 INFO L225 Difference]: With dead ends: 1064 [2025-02-05 15:36:15,401 INFO L226 Difference]: Without dead ends: 526 [2025-02-05 15:36:15,402 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-02-05 15:36:15,403 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 0 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2641 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-02-05 15:36:15,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2641 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-05 15:36:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-02-05 15:36:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.685851318944844) internal successors, (703), 436 states have internal predecessors, (703), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 874 transitions. [2025-02-05 15:36:15,438 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 874 transitions. Word has length 97 [2025-02-05 15:36:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:15,438 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 874 transitions. [2025-02-05 15:36:15,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 874 transitions. [2025-02-05 15:36:15,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:36:15,442 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:15,442 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:15,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:36:15,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:15,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:15,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1054374457, now seen corresponding path program 1 times [2025-02-05 15:36:15,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:15,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418159290] [2025-02-05 15:36:15,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:15,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:15,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:36:15,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:36:15,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:15,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:15,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:15,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:15,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418159290] [2025-02-05 15:36:15,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418159290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:15,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:15,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:15,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670735807] [2025-02-05 15:36:15,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:15,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:15,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:15,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:15,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:15,566 INFO L87 Difference]: Start difference. First operand 526 states and 874 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:15,719 INFO L93 Difference]: Finished difference Result 1009 states and 1682 transitions. [2025-02-05 15:36:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:15,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-02-05 15:36:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:15,723 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:36:15,723 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:36:15,725 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-02-05 15:36:15,726 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 55 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4126 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-02-05 15:36:15,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4126 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:15,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:36:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-02-05 15:36:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.6762589928057554) internal successors, (699), 436 states have internal predecessors, (699), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 870 transitions. [2025-02-05 15:36:15,742 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 870 transitions. Word has length 98 [2025-02-05 15:36:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:15,742 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 870 transitions. [2025-02-05 15:36:15,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 870 transitions. [2025-02-05 15:36:15,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:36:15,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:15,745 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:15,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:36:15,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:15,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:15,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1552904844, now seen corresponding path program 1 times [2025-02-05 15:36:15,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:15,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490460745] [2025-02-05 15:36:15,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:15,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:15,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:36:15,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:36:15,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:15,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:15,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:15,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490460745] [2025-02-05 15:36:15,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490460745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:15,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:15,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:15,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490735455] [2025-02-05 15:36:15,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:15,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:15,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:15,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:15,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:15,895 INFO L87 Difference]: Start difference. First operand 526 states and 870 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:16,043 INFO L93 Difference]: Finished difference Result 1009 states and 1678 transitions. [2025-02-05 15:36:16,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:16,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2025-02-05 15:36:16,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:16,047 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:36:16,047 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:36:16,049 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-02-05 15:36:16,051 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 54 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4126 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-02-05 15:36:16,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4126 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:36:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-02-05 15:36:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.6666666666666667) internal successors, (695), 436 states have internal predecessors, (695), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 866 transitions. [2025-02-05 15:36:16,071 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 866 transitions. Word has length 99 [2025-02-05 15:36:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,071 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 866 transitions. [2025-02-05 15:36:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 866 transitions. [2025-02-05 15:36:16,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:36:16,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,074 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:16,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:36:16,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1670221782, now seen corresponding path program 1 times [2025-02-05 15:36:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961986597] [2025-02-05 15:36:16,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:36:16,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:36:16,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:16,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961986597] [2025-02-05 15:36:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961986597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:16,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:16,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:16,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668960425] [2025-02-05 15:36:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:16,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:16,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:16,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:16,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:16,200 INFO L87 Difference]: Start difference. First operand 526 states and 866 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:16,332 INFO L93 Difference]: Finished difference Result 1009 states and 1674 transitions. [2025-02-05 15:36:16,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 100 [2025-02-05 15:36:16,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:16,337 INFO L225 Difference]: With dead ends: 1009 [2025-02-05 15:36:16,337 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:36:16,339 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-02-05 15:36:16,340 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 53 mSDsluCounter, 3278 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4108 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-02-05 15:36:16,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4108 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:16,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:36:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2025-02-05 15:36:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 417 states have (on average 1.6570743405275778) internal successors, (691), 436 states have internal predecessors, (691), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:16,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 862 transitions. [2025-02-05 15:36:16,355 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 862 transitions. Word has length 100 [2025-02-05 15:36:16,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,355 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 862 transitions. [2025-02-05 15:36:16,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 862 transitions. [2025-02-05 15:36:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 15:36:16,358 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,358 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:16,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:36:16,358 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 543420505, now seen corresponding path program 1 times [2025-02-05 15:36:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345541921] [2025-02-05 15:36:16,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 15:36:16,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 15:36:16,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:16,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:16,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:16,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345541921] [2025-02-05 15:36:16,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345541921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:16,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:16,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078145013] [2025-02-05 15:36:16,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:16,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:16,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:16,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:16,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:16,490 INFO L87 Difference]: Start difference. First operand 526 states and 862 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:36:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:16,544 INFO L93 Difference]: Finished difference Result 1000 states and 1656 transitions. [2025-02-05 15:36:16,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:16,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 100 [2025-02-05 15:36:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:16,548 INFO L225 Difference]: With dead ends: 1000 [2025-02-05 15:36:16,548 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:36:16,550 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-02-05 15:36:16,550 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 84 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5033 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-02-05 15:36:16,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5033 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:36:16,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:36:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6590909090909092) internal successors, (657), 415 states have internal predecessors, (657), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 828 transitions. [2025-02-05 15:36:16,564 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 828 transitions. Word has length 100 [2025-02-05 15:36:16,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,564 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 828 transitions. [2025-02-05 15:36:16,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:36:16,564 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 828 transitions. [2025-02-05 15:36:16,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 15:36:16,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,567 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:16,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:36:16,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1440143607, now seen corresponding path program 1 times [2025-02-05 15:36:16,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051646320] [2025-02-05 15:36:16,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 15:36:16,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 15:36:16,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:16,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:16,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:16,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051646320] [2025-02-05 15:36:16,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051646320] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896965309] [2025-02-05 15:36:16,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:16,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:16,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:16,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:16,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:16,665 INFO L87 Difference]: Start difference. First operand 505 states and 828 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:16,725 INFO L93 Difference]: Finished difference Result 979 states and 1622 transitions. [2025-02-05 15:36:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2025-02-05 15:36:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:16,754 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:36:16,754 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:36:16,756 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-02-05 15:36:16,756 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 17 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4046 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-02-05 15:36:16,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4046 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:16,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:36:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:36:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6565656565656566) internal successors, (656), 415 states have internal predecessors, (656), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 827 transitions. [2025-02-05 15:36:16,770 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 827 transitions. Word has length 101 [2025-02-05 15:36:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,770 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 827 transitions. [2025-02-05 15:36:16,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,770 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 827 transitions. [2025-02-05 15:36:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 15:36:16,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,773 INFO L218 NwaCegarLoop]: trace histogram [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-02-05 15:36:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:36:16,774 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1529446029, now seen corresponding path program 1 times [2025-02-05 15:36:16,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252351453] [2025-02-05 15:36:16,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 15:36:16,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 15:36:16,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:16,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:16,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252351453] [2025-02-05 15:36:16,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252351453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:16,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:16,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:16,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647908060] [2025-02-05 15:36:16,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:16,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:16,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:16,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:16,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:16,892 INFO L87 Difference]: Start difference. First operand 505 states and 827 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:16,958 INFO L93 Difference]: Finished difference Result 979 states and 1621 transitions. [2025-02-05 15:36:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 102 [2025-02-05 15:36:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:16,963 INFO L225 Difference]: With dead ends: 979 [2025-02-05 15:36:16,963 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:36:16,965 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-02-05 15:36:16,965 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 16 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4046 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-02-05 15:36:16,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4046 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:36:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:36:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.654040404040404) internal successors, (655), 415 states have internal predecessors, (655), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 826 transitions. [2025-02-05 15:36:16,978 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 826 transitions. Word has length 102 [2025-02-05 15:36:16,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:16,978 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 826 transitions. [2025-02-05 15:36:16,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:16,978 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 826 transitions. [2025-02-05 15:36:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 15:36:16,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:16,980 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:16,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:36:16,981 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1839890310, now seen corresponding path program 1 times [2025-02-05 15:36:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:16,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105135951] [2025-02-05 15:36:16,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:16,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:16,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 15:36:17,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 15:36:17,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:17,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:17,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105135951] [2025-02-05 15:36:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105135951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:36:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953892540] [2025-02-05 15:36:17,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:36:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:17,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:36:17,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:17,161 INFO L87 Difference]: Start difference. First operand 505 states and 826 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:36:17,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:17,258 INFO L93 Difference]: Finished difference Result 973 states and 1609 transitions. [2025-02-05 15:36:17,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:36:17,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2025-02-05 15:36:17,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:17,263 INFO L225 Difference]: With dead ends: 973 [2025-02-05 15:36:17,263 INFO L226 Difference]: Without dead ends: 505 [2025-02-05 15:36:17,265 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-02-05 15:36:17,266 INFO L435 NwaCegarLoop]: 810 mSDtfsCounter, 6 mSDsluCounter, 6458 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7268 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-02-05 15:36:17,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7268 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:17,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-02-05 15:36:17,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-02-05 15:36:17,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 396 states have (on average 1.6515151515151516) internal successors, (654), 415 states have internal predecessors, (654), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 825 transitions. [2025-02-05 15:36:17,280 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 825 transitions. Word has length 103 [2025-02-05 15:36:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:17,280 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 825 transitions. [2025-02-05 15:36:17,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:36:17,280 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 825 transitions. [2025-02-05 15:36:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:36:17,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:17,282 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:36:17,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1398903072, now seen corresponding path program 1 times [2025-02-05 15:36:17,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878341052] [2025-02-05 15:36:17,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:17,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:36:17,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:36:17,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:17,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 15:36:17,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878341052] [2025-02-05 15:36:17,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878341052] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:17,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759979564] [2025-02-05 15:36:17,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:17,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:17,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:17,473 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:17,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:36:17,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:36:17,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:36:17,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:17,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:17,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 1407 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 15:36:17,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:36:17,784 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759979564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:17,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:17,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-02-05 15:36:17,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841456967] [2025-02-05 15:36:17,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:17,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:17,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:17,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:17,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:17,785 INFO L87 Difference]: Start difference. First operand 505 states and 825 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:17,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:17,831 INFO L93 Difference]: Finished difference Result 967 states and 1604 transitions. [2025-02-05 15:36:17,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:36:17,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2025-02-05 15:36:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:17,835 INFO L225 Difference]: With dead ends: 967 [2025-02-05 15:36:17,835 INFO L226 Difference]: Without dead ends: 507 [2025-02-05 15:36:17,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 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-02-05 15:36:17,838 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 0 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:17,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2463 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:17,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-02-05 15:36:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2025-02-05 15:36:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 398 states have (on average 1.6482412060301508) internal successors, (656), 417 states have internal predecessors, (656), 88 states have call successors, (88), 21 states have call predecessors, (88), 20 states have return successors, (83), 81 states have call predecessors, (83), 83 states have call successors, (83) [2025-02-05 15:36:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 827 transitions. [2025-02-05 15:36:17,851 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 827 transitions. Word has length 104 [2025-02-05 15:36:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:17,851 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 827 transitions. [2025-02-05 15:36:17,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-05 15:36:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 827 transitions. [2025-02-05 15:36:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:36:17,854 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:17,854 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:17,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:36:18,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 15:36:18,055 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1271860043, now seen corresponding path program 1 times [2025-02-05 15:36:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738155188] [2025-02-05 15:36:18,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:18,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:36:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:36:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:18,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:18,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:18,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738155188] [2025-02-05 15:36:18,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738155188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:18,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:18,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:18,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50017705] [2025-02-05 15:36:18,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:18,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:18,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:18,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:18,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:18,183 INFO L87 Difference]: Start difference. First operand 507 states and 827 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 15:36:20,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:20,452 INFO L93 Difference]: Finished difference Result 1712 states and 2869 transitions. [2025-02-05 15:36:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 15:36:20,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 107 [2025-02-05 15:36:20,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:20,460 INFO L225 Difference]: With dead ends: 1712 [2025-02-05 15:36:20,460 INFO L226 Difference]: Without dead ends: 1250 [2025-02-05 15:36:20,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:36:20,463 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 2338 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 3568 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2418 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 4043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:20,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2418 Valid, 1902 Invalid, 4043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3568 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 15:36:20,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-02-05 15:36:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1139. [2025-02-05 15:36:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 899 states have (on average 1.6763070077864293) internal successors, (1507), 938 states have internal predecessors, (1507), 193 states have call successors, (193), 41 states have call predecessors, (193), 46 states have return successors, (204), 185 states have call predecessors, (204), 188 states have call successors, (204) [2025-02-05 15:36:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1904 transitions. [2025-02-05 15:36:20,509 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1904 transitions. Word has length 107 [2025-02-05 15:36:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:20,510 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1904 transitions. [2025-02-05 15:36:20,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 5 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-05 15:36:20,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1904 transitions. [2025-02-05 15:36:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 15:36:20,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:20,512 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:36:20,513 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:20,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1197345324, now seen corresponding path program 1 times [2025-02-05 15:36:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157943744] [2025-02-05 15:36:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:20,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 15:36:20,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 15:36:20,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:20,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:20,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:20,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157943744] [2025-02-05 15:36:20,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157943744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:20,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:20,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:36:20,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997253029] [2025-02-05 15:36:20,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:20,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:20,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:20,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:20,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:20,627 INFO L87 Difference]: Start difference. First operand 1139 states and 1904 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:36:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:20,700 INFO L93 Difference]: Finished difference Result 2249 states and 3785 transitions. [2025-02-05 15:36:20,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:20,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-02-05 15:36:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:20,709 INFO L225 Difference]: With dead ends: 2249 [2025-02-05 15:36:20,709 INFO L226 Difference]: Without dead ends: 1155 [2025-02-05 15:36:20,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:20,715 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 0 mSDsluCounter, 2439 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3262 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:20,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3262 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:20,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2025-02-05 15:36:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1151. [2025-02-05 15:36:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 908 states have (on average 1.669603524229075) internal successors, (1516), 947 states have internal predecessors, (1516), 193 states have call successors, (193), 41 states have call predecessors, (193), 49 states have return successors, (210), 188 states have call predecessors, (210), 188 states have call successors, (210) [2025-02-05 15:36:20,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1919 transitions. [2025-02-05 15:36:20,777 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1919 transitions. Word has length 112 [2025-02-05 15:36:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:20,778 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1919 transitions. [2025-02-05 15:36:20,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:36:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1919 transitions. [2025-02-05 15:36:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:36:20,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:20,781 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:36:20,781 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:20,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash -757938182, now seen corresponding path program 1 times [2025-02-05 15:36:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019987867] [2025-02-05 15:36:20,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:20,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:20,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:36:20,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:36:20,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:20,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:20,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019987867] [2025-02-05 15:36:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019987867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:20,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:36:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538292261] [2025-02-05 15:36:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:20,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:36:20,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:20,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:36:20,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:36:20,995 INFO L87 Difference]: Start difference. First operand 1151 states and 1919 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-05 15:36:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,372 INFO L93 Difference]: Finished difference Result 3861 states and 6538 transitions. [2025-02-05 15:36:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:36:24,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 116 [2025-02-05 15:36:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,388 INFO L225 Difference]: With dead ends: 3861 [2025-02-05 15:36:24,388 INFO L226 Difference]: Without dead ends: 2755 [2025-02-05 15:36:24,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:24,395 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 2755 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 3412 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2901 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 4020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 3412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:24,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2901 Valid, 1855 Invalid, 4020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 3412 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 15:36:24,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2025-02-05 15:36:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2695. [2025-02-05 15:36:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2114 states have (on average 1.653736991485336) internal successors, (3496), 2204 states have internal predecessors, (3496), 462 states have call successors, (462), 94 states have call predecessors, (462), 118 states have return successors, (551), 457 states have call predecessors, (551), 457 states have call successors, (551) [2025-02-05 15:36:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 4509 transitions. [2025-02-05 15:36:24,507 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 4509 transitions. Word has length 116 [2025-02-05 15:36:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,507 INFO L471 AbstractCegarLoop]: Abstraction has 2695 states and 4509 transitions. [2025-02-05 15:36:24,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 7 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-05 15:36:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4509 transitions. [2025-02-05 15:36:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 15:36:24,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,510 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:36:24,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1059515278, now seen corresponding path program 1 times [2025-02-05 15:36:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717775636] [2025-02-05 15:36:24,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 15:36:24,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 15:36:24,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:24,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:36:24,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:24,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717775636] [2025-02-05 15:36:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717775636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:24,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:24,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:36:24,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829842135] [2025-02-05 15:36:24,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:24,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:36:24,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:24,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:36:24,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:36:24,666 INFO L87 Difference]: Start difference. First operand 2695 states and 4509 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:36:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:24,818 INFO L93 Difference]: Finished difference Result 5352 states and 9113 transitions. [2025-02-05 15:36:24,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:36:24,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 119 [2025-02-05 15:36:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:24,837 INFO L225 Difference]: With dead ends: 5352 [2025-02-05 15:36:24,837 INFO L226 Difference]: Without dead ends: 2743 [2025-02-05 15:36:24,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:24,847 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 225 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4072 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:24,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4072 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2025-02-05 15:36:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2695. [2025-02-05 15:36:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2695 states, 2114 states have (on average 1.6319772942289499) internal successors, (3450), 2204 states have internal predecessors, (3450), 462 states have call successors, (462), 94 states have call predecessors, (462), 118 states have return successors, (551), 457 states have call predecessors, (551), 457 states have call successors, (551) [2025-02-05 15:36:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 4463 transitions. [2025-02-05 15:36:24,954 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 4463 transitions. Word has length 119 [2025-02-05 15:36:24,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:24,955 INFO L471 AbstractCegarLoop]: Abstraction has 2695 states and 4463 transitions. [2025-02-05 15:36:24,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 15:36:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4463 transitions. [2025-02-05 15:36:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 15:36:24,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:24,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:36:24,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:36:24,959 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:24,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:24,959 INFO L85 PathProgramCache]: Analyzing trace with hash -903079434, now seen corresponding path program 1 times [2025-02-05 15:36:24,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:24,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864261590] [2025-02-05 15:36:24,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:24,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:36:24,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:36:24,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:24,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:36:25,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864261590] [2025-02-05 15:36:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864261590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:36:25,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255797246] [2025-02-05 15:36:25,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:25,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:36:25,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:36:25,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:36:25,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 15:36:25,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 15:36:25,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:25,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:36:25,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:36:25,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:36:25,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:36:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255797246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:25,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:36:25,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-05 15:36:25,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584464549] [2025-02-05 15:36:25,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:25,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:36:25,355 INFO L87 Difference]: Start difference. First operand 2695 states and 4463 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:25,469 INFO L93 Difference]: Finished difference Result 5394 states and 9073 transitions. [2025-02-05 15:36:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-02-05 15:36:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:25,482 INFO L225 Difference]: With dead ends: 5394 [2025-02-05 15:36:25,482 INFO L226 Difference]: Without dead ends: 2743 [2025-02-05 15:36:25,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:36:25,492 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 14 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2369 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:25,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2369 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:36:25,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2743 states. [2025-02-05 15:36:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2743 to 2743. [2025-02-05 15:36:25,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2743 states, 2156 states have (on average 1.6331168831168832) internal successors, (3521), 2246 states have internal predecessors, (3521), 462 states have call successors, (462), 100 states have call predecessors, (462), 124 states have return successors, (556), 457 states have call predecessors, (556), 457 states have call successors, (556) [2025-02-05 15:36:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2743 states to 2743 states and 4539 transitions. [2025-02-05 15:36:25,574 INFO L78 Accepts]: Start accepts. Automaton has 2743 states and 4539 transitions. Word has length 123 [2025-02-05 15:36:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:25,574 INFO L471 AbstractCegarLoop]: Abstraction has 2743 states and 4539 transitions. [2025-02-05 15:36:25,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:36:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2743 states and 4539 transitions. [2025-02-05 15:36:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 15:36:25,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:25,577 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:25,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:36:25,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:36:25,778 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:25,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1752391234, now seen corresponding path program 1 times [2025-02-05 15:36:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:25,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225643285] [2025-02-05 15:36:25,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:25,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 15:36:25,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 15:36:25,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:36:26,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:26,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225643285] [2025-02-05 15:36:26,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225643285] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:26,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:26,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:36:26,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483675794] [2025-02-05 15:36:26,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:26,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:36:26,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:26,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:36:26,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:26,004 INFO L87 Difference]: Start difference. First operand 2743 states and 4539 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:36:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:27,880 INFO L93 Difference]: Finished difference Result 5399 states and 8958 transitions. [2025-02-05 15:36:27,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:36:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2025-02-05 15:36:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:27,897 INFO L225 Difference]: With dead ends: 5399 [2025-02-05 15:36:27,897 INFO L226 Difference]: Without dead ends: 3093 [2025-02-05 15:36:27,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:36:27,906 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 2014 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2090 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 3522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:27,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2090 Valid, 1673 Invalid, 3522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 3081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 15:36:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3093 states. [2025-02-05 15:36:28,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3093 to 2850. [2025-02-05 15:36:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 2236 states have (on average 1.6216457960644006) internal successors, (3626), 2334 states have internal predecessors, (3626), 472 states have call successors, (472), 109 states have call predecessors, (472), 141 states have return successors, (588), 467 states have call predecessors, (588), 467 states have call successors, (588) [2025-02-05 15:36:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 4686 transitions. [2025-02-05 15:36:28,054 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 4686 transitions. Word has length 124 [2025-02-05 15:36:28,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:28,054 INFO L471 AbstractCegarLoop]: Abstraction has 2850 states and 4686 transitions. [2025-02-05 15:36:28,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:36:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 4686 transitions. [2025-02-05 15:36:28,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:36:28,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:28,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:28,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:36:28,058 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:28,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:28,058 INFO L85 PathProgramCache]: Analyzing trace with hash -611486440, now seen corresponding path program 1 times [2025-02-05 15:36:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039116395] [2025-02-05 15:36:28,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:28,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:28,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:28,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:28,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:28,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 15:36:28,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039116395] [2025-02-05 15:36:28,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039116395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:28,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:28,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:36:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913437327] [2025-02-05 15:36:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:28,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:28,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:28,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:28,142 INFO L87 Difference]: Start difference. First operand 2850 states and 4686 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:36:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:28,249 INFO L93 Difference]: Finished difference Result 6077 states and 10058 transitions. [2025-02-05 15:36:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-02-05 15:36:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:28,266 INFO L225 Difference]: With dead ends: 6077 [2025-02-05 15:36:28,266 INFO L226 Difference]: Without dead ends: 3664 [2025-02-05 15:36:28,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:28,274 INFO L435 NwaCegarLoop]: 1334 mSDtfsCounter, 755 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 4793 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:28,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 4793 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-02-05 15:36:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3428. [2025-02-05 15:36:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3428 states, 2699 states have (on average 1.6268988514264542) internal successors, (4391), 2808 states have internal predecessors, (4391), 564 states have call successors, (564), 130 states have call predecessors, (564), 164 states have return successors, (690), 562 states have call predecessors, (690), 559 states have call successors, (690) [2025-02-05 15:36:28,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 5645 transitions. [2025-02-05 15:36:28,371 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 5645 transitions. Word has length 129 [2025-02-05 15:36:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 3428 states and 5645 transitions. [2025-02-05 15:36:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-02-05 15:36:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 5645 transitions. [2025-02-05 15:36:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 15:36:28,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:28,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:36:28,375 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1534170023, now seen corresponding path program 1 times [2025-02-05 15:36:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:28,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678868460] [2025-02-05 15:36:28,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:28,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 15:36:28,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 15:36:28,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:28,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:36:28,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:28,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678868460] [2025-02-05 15:36:28,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678868460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:28,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:28,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:36:28,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526273049] [2025-02-05 15:36:28,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:28,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:36:28,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:28,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:36:28,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:36:28,646 INFO L87 Difference]: Start difference. First operand 3428 states and 5645 transitions. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:36:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:29,863 INFO L93 Difference]: Finished difference Result 6854 states and 11365 transitions. [2025-02-05 15:36:29,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:36:29,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 129 [2025-02-05 15:36:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:29,881 INFO L225 Difference]: With dead ends: 6854 [2025-02-05 15:36:29,881 INFO L226 Difference]: Without dead ends: 3474 [2025-02-05 15:36:29,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-05 15:36:29,891 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1229 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 2906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:29,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 1579 Invalid, 2906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:36:29,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2025-02-05 15:36:30,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3452. [2025-02-05 15:36:30,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 2717 states have (on average 1.6227456753772542) internal successors, (4409), 2826 states have internal predecessors, (4409), 564 states have call successors, (564), 130 states have call predecessors, (564), 170 states have return successors, (700), 568 states have call predecessors, (700), 559 states have call successors, (700) [2025-02-05 15:36:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 5673 transitions. [2025-02-05 15:36:30,023 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 5673 transitions. Word has length 129 [2025-02-05 15:36:30,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:30,024 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 5673 transitions. [2025-02-05 15:36:30,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 7 states have internal predecessors, (97), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:36:30,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 5673 transitions. [2025-02-05 15:36:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 15:36:30,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:30,027 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:30,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 15:36:30,027 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:30,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1265398818, now seen corresponding path program 1 times [2025-02-05 15:36:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023592322] [2025-02-05 15:36:30,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:30,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 15:36:30,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 15:36:30,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:30,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:30,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:36:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:30,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023592322] [2025-02-05 15:36:30,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023592322] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:30,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:30,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 15:36:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285801707] [2025-02-05 15:36:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:30,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:36:30,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:30,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:36:30,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:36:30,182 INFO L87 Difference]: Start difference. First operand 3452 states and 5673 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:36:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:33,094 INFO L93 Difference]: Finished difference Result 7662 states and 12566 transitions. [2025-02-05 15:36:33,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 15:36:33,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 132 [2025-02-05 15:36:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:33,122 INFO L225 Difference]: With dead ends: 7662 [2025-02-05 15:36:33,123 INFO L226 Difference]: Without dead ends: 4584 [2025-02-05 15:36:33,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-02-05 15:36:33,132 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2037 mSDsluCounter, 3093 mSDsCounter, 0 mSdLazyCounter, 6781 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2122 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 7199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 6781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:33,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2122 Valid, 3645 Invalid, 7199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 6781 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 15:36:33,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2025-02-05 15:36:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4055. [2025-02-05 15:36:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4055 states, 3193 states have (on average 1.6044472283119324) internal successors, (5123), 3326 states have internal predecessors, (5123), 640 states have call successors, (640), 161 states have call predecessors, (640), 221 states have return successors, (813), 640 states have call predecessors, (813), 635 states have call successors, (813) [2025-02-05 15:36:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4055 states to 4055 states and 6576 transitions. [2025-02-05 15:36:33,267 INFO L78 Accepts]: Start accepts. Automaton has 4055 states and 6576 transitions. Word has length 132 [2025-02-05 15:36:33,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:33,267 INFO L471 AbstractCegarLoop]: Abstraction has 4055 states and 6576 transitions. [2025-02-05 15:36:33,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:36:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4055 states and 6576 transitions. [2025-02-05 15:36:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 15:36:33,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:33,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:33,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 15:36:33,270 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:33,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 917979999, now seen corresponding path program 2 times [2025-02-05 15:36:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773456221] [2025-02-05 15:36:33,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:36:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:33,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-02-05 15:36:33,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 60 of 130 statements. [2025-02-05 15:36:33,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:36:33,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:36:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773456221] [2025-02-05 15:36:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773456221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:33,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:33,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234088867] [2025-02-05 15:36:33,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:33,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:33,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:33,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:33,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:33,384 INFO L87 Difference]: Start difference. First operand 4055 states and 6576 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:36:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:34,741 INFO L93 Difference]: Finished difference Result 12897 states and 21299 transitions. [2025-02-05 15:36:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:34,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 130 [2025-02-05 15:36:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:34,821 INFO L225 Difference]: With dead ends: 12897 [2025-02-05 15:36:34,822 INFO L226 Difference]: Without dead ends: 8887 [2025-02-05 15:36:34,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:34,830 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1840 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:34,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 920 Invalid, 1568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 15:36:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-02-05 15:36:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8547. [2025-02-05 15:36:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8547 states, 6642 states have (on average 1.600271002710027) internal successors, (10629), 6954 states have internal predecessors, (10629), 1440 states have call successors, (1440), 317 states have call predecessors, (1440), 464 states have return successors, (1987), 1451 states have call predecessors, (1987), 1435 states have call successors, (1987) [2025-02-05 15:36:35,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 14056 transitions. [2025-02-05 15:36:35,098 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 14056 transitions. Word has length 130 [2025-02-05 15:36:35,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:35,099 INFO L471 AbstractCegarLoop]: Abstraction has 8547 states and 14056 transitions. [2025-02-05 15:36:35,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-02-05 15:36:35,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 14056 transitions. [2025-02-05 15:36:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:36:35,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:35,103 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:36:35,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 15:36:35,103 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:35,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1235356625, now seen corresponding path program 1 times [2025-02-05 15:36:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:35,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707296239] [2025-02-05 15:36:35,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:35,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:36:35,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:36:35,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:35,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 15:36:35,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:35,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707296239] [2025-02-05 15:36:35,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707296239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:35,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:35,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138886374] [2025-02-05 15:36:35,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:35,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:35,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:35,167 INFO L87 Difference]: Start difference. First operand 8547 states and 14056 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 15:36:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:35,532 INFO L93 Difference]: Finished difference Result 17085 states and 28278 transitions. [2025-02-05 15:36:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:35,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-02-05 15:36:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:35,577 INFO L225 Difference]: With dead ends: 17085 [2025-02-05 15:36:35,578 INFO L226 Difference]: Without dead ends: 8443 [2025-02-05 15:36:35,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:35,609 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 12 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:35,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2344 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:36:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8443 states. [2025-02-05 15:36:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8443 to 8443. [2025-02-05 15:36:36,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8443 states, 6550 states have (on average 1.590381679389313) internal successors, (10417), 6850 states have internal predecessors, (10417), 1440 states have call successors, (1440), 329 states have call predecessors, (1440), 452 states have return successors, (1967), 1439 states have call predecessors, (1967), 1435 states have call successors, (1967) [2025-02-05 15:36:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8443 states to 8443 states and 13824 transitions. [2025-02-05 15:36:36,093 INFO L78 Accepts]: Start accepts. Automaton has 8443 states and 13824 transitions. Word has length 133 [2025-02-05 15:36:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:36,095 INFO L471 AbstractCegarLoop]: Abstraction has 8443 states and 13824 transitions. [2025-02-05 15:36:36,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-05 15:36:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8443 states and 13824 transitions. [2025-02-05 15:36:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 15:36:36,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:36,099 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:36:36,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 15:36:36,101 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:36,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:36,101 INFO L85 PathProgramCache]: Analyzing trace with hash -512082207, now seen corresponding path program 1 times [2025-02-05 15:36:36,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:36,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999744431] [2025-02-05 15:36:36,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:36,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:36,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 15:36:36,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 15:36:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 15:36:36,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:36,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999744431] [2025-02-05 15:36:36,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999744431] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:36,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:36,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:36:36,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489951946] [2025-02-05 15:36:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:36,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:36:36,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:36,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:36:36,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:36,226 INFO L87 Difference]: Start difference. First operand 8443 states and 13824 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:36:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:38,536 INFO L93 Difference]: Finished difference Result 30833 states and 52460 transitions. [2025-02-05 15:36:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:36:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2025-02-05 15:36:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:38,713 INFO L225 Difference]: With dead ends: 30833 [2025-02-05 15:36:38,713 INFO L226 Difference]: Without dead ends: 22439 [2025-02-05 15:36:38,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:36:38,749 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 2153 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:38,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 1348 Invalid, 2668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 15:36:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22439 states. [2025-02-05 15:36:39,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22439 to 21831. [2025-02-05 15:36:39,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21831 states, 16362 states have (on average 1.579330155237746) internal successors, (25841), 17289 states have internal predecessors, (25841), 4389 states have call successors, (4389), 733 states have call predecessors, (4389), 1079 states have return successors, (6904), 4412 states have call predecessors, (6904), 4384 states have call successors, (6904) [2025-02-05 15:36:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21831 states to 21831 states and 37134 transitions. [2025-02-05 15:36:39,791 INFO L78 Accepts]: Start accepts. Automaton has 21831 states and 37134 transitions. Word has length 133 [2025-02-05 15:36:39,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:39,792 INFO L471 AbstractCegarLoop]: Abstraction has 21831 states and 37134 transitions. [2025-02-05 15:36:39,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:36:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 21831 states and 37134 transitions. [2025-02-05 15:36:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 15:36:39,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:39,798 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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] [2025-02-05 15:36:39,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 15:36:39,798 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:39,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1026214751, now seen corresponding path program 1 times [2025-02-05 15:36:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439935448] [2025-02-05 15:36:39,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 15:36:39,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 15:36:39,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:39,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-05 15:36:39,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:39,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439935448] [2025-02-05 15:36:39,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439935448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:39,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:39,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:39,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808608329] [2025-02-05 15:36:39,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:39,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:39,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:39,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:39,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:39,915 INFO L87 Difference]: Start difference. First operand 21831 states and 37134 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:36:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:43,687 INFO L93 Difference]: Finished difference Result 72592 states and 129677 transitions. [2025-02-05 15:36:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:43,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 139 [2025-02-05 15:36:43,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:43,994 INFO L225 Difference]: With dead ends: 72592 [2025-02-05 15:36:43,994 INFO L226 Difference]: Without dead ends: 50806 [2025-02-05 15:36:44,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:44,088 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1836 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:44,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 880 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 15:36:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50806 states. [2025-02-05 15:36:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50806 to 48951. [2025-02-05 15:36:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48951 states, 35857 states have (on average 1.5716596480464065) internal successors, (56355), 38132 states have internal predecessors, (56355), 10778 states have call successors, (10778), 1461 states have call predecessors, (10778), 2315 states have return successors, (20199), 10901 states have call predecessors, (20199), 10773 states have call successors, (20199) [2025-02-05 15:36:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48951 states to 48951 states and 87332 transitions. [2025-02-05 15:36:47,573 INFO L78 Accepts]: Start accepts. Automaton has 48951 states and 87332 transitions. Word has length 139 [2025-02-05 15:36:47,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:36:47,576 INFO L471 AbstractCegarLoop]: Abstraction has 48951 states and 87332 transitions. [2025-02-05 15:36:47,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-02-05 15:36:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 48951 states and 87332 transitions. [2025-02-05 15:36:47,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 15:36:47,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:36:47,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:36:47,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 15:36:47,582 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:36:47,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:36:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1026019695, now seen corresponding path program 1 times [2025-02-05 15:36:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:36:47,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873833889] [2025-02-05 15:36:47,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:36:47,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:36:47,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 15:36:47,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 15:36:47,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:36:47,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:36:47,842 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:36:47,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:36:47,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873833889] [2025-02-05 15:36:47,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873833889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:36:47,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:36:47,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:36:47,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368317472] [2025-02-05 15:36:47,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:36:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:36:47,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:36:47,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:36:47,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:36:47,844 INFO L87 Difference]: Start difference. First operand 48951 states and 87332 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:36:55,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:36:55,634 INFO L93 Difference]: Finished difference Result 165784 states and 317928 transitions. [2025-02-05 15:36:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:36:55,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 142 [2025-02-05 15:36:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:36:56,914 INFO L225 Difference]: With dead ends: 165784 [2025-02-05 15:36:56,914 INFO L226 Difference]: Without dead ends: 116878 [2025-02-05 15:36:57,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:36:57,144 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1818 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:36:57,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 880 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 15:36:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116878 states. [2025-02-05 15:37:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116878 to 112954. [2025-02-05 15:37:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112954 states, 80712 states have (on average 1.5631504608980078) internal successors, (126165), 86371 states have internal predecessors, (126165), 27222 states have call successors, (27222), 2917 states have call predecessors, (27222), 5019 states have return successors, (61579), 27689 states have call predecessors, (61579), 27217 states have call successors, (61579) [2025-02-05 15:37:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112954 states to 112954 states and 214966 transitions. [2025-02-05 15:37:04,707 INFO L78 Accepts]: Start accepts. Automaton has 112954 states and 214966 transitions. Word has length 142 [2025-02-05 15:37:04,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:04,708 INFO L471 AbstractCegarLoop]: Abstraction has 112954 states and 214966 transitions. [2025-02-05 15:37:04,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-05 15:37:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 112954 states and 214966 transitions. [2025-02-05 15:37:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-05 15:37:04,715 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:04,715 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:37:04,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 15:37:04,715 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:04,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:04,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1741665111, now seen corresponding path program 1 times [2025-02-05 15:37:04,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:04,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141229601] [2025-02-05 15:37:04,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:04,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:04,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-05 15:37:04,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-05 15:37:04,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:04,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:37:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:04,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141229601] [2025-02-05 15:37:04,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141229601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:04,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:04,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:04,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323220593] [2025-02-05 15:37:04,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:04,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:04,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:04,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:04,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:04,795 INFO L87 Difference]: Start difference. First operand 112954 states and 214966 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)