./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:26:16,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:26:16,804 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:26:16,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:26:16,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:26:16,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:26:16,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:26:16,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:26:16,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:26:16,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:26:16,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:26:16,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:26:16,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:26:16,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:26:16,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:26:16,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:26:16,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:26:16,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:26:16,833 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68493680033c9035e39b01d00eb3730662e9195bee3c7e3d4b2805e2b52b60ec [2025-03-08 05:26:17,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:26:17,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:26:17,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:26:17,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:26:17,055 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:26:17,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-03-08 05:26:18,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ed7e5d2/797c0fdc4a6f46f8ab91ba4947d78d74/FLAGb3027bc9d [2025-03-08 05:26:18,569 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:26:18,570 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c [2025-03-08 05:26:18,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ed7e5d2/797c0fdc4a6f46f8ab91ba4947d78d74/FLAGb3027bc9d [2025-03-08 05:26:18,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ed7e5d2/797c0fdc4a6f46f8ab91ba4947d78d74 [2025-03-08 05:26:18,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:26:18,830 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:26:18,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:26:18,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:26:18,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:26:18,835 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:26:18" (1/1) ... [2025-03-08 05:26:18,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446a8a32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:18, skipping insertion in model container [2025-03-08 05:26:18,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:26:18" (1/1) ... [2025-03-08 05:26:18,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:26:19,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c[66231,66244] [2025-03-08 05:26:19,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:26:19,257 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:26:19,264 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-03-08 05:26:19,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [86] [2025-03-08 05:26:19,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [100] [2025-03-08 05:26:19,265 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [286] [2025-03-08 05:26:19,266 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1765] [2025-03-08 05:26:19,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1884] [2025-03-08 05:26:19,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2546] [2025-03-08 05:26:19,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2638] [2025-03-08 05:26:19,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2025-03-08 05:26:19,267 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3013] [2025-03-08 05:26:19,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product25.cil.c[66231,66244] [2025-03-08 05:26:19,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:26:19,371 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:26:19,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19 WrapperNode [2025-03-08 05:26:19,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:26:19,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:26:19,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:26:19,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:26:19,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,419 INFO L138 Inliner]: procedures = 91, calls = 334, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 842 [2025-03-08 05:26:19,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:26:19,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:26:19,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:26:19,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:26:19,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,457 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:26:19,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:26:19,493 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:26:19,493 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:26:19,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:26:19,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (1/1) ... [2025-03-08 05:26:19,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:26:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:26:19,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:26:19,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:26:19,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:26:19,541 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:26:19,541 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:26:19,541 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:26:19,541 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:26:19,541 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:26:19,541 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:26:19,541 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:26:19,541 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:26:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:26:19,542 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:26:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:26:19,542 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:26:19,542 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:26:19,543 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:26:19,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:26:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:26:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:26:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:26:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:26:19,544 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:26:19,544 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:26:19,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:26:19,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:26:19,741 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1881: #res := ~retValue_acc~17; [2025-03-08 05:26:19,756 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1803: #res := ~retValue_acc~15; [2025-03-08 05:26:19,759 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: #res := ~retValue_acc~2; [2025-03-08 05:26:19,998 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1086: #res := ~retValue_acc~10; [2025-03-08 05:26:20,067 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1190: #res := ~retValue_acc~13; [2025-03-08 05:26:20,078 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1842: #res := ~retValue_acc~16; [2025-03-08 05:26:20,163 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L641-1: isEmpty_#res#1 := isEmpty_~retValue_acc~7#1; [2025-03-08 05:26:20,286 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1176-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~12#1; [2025-03-08 05:26:20,286 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L549-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~3#1; [2025-03-08 05:26:20,287 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L592-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~5#1; [2025-03-08 05:26:20,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~8#1; [2025-03-08 05:26:20,349 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: isIdle_#res#1 := isIdle_~retValue_acc~9#1; [2025-03-08 05:26:20,399 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: #res := ~retValue_acc~19; [2025-03-08 05:26:20,454 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-03-08 05:26:20,455 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3360-1: main_#res#1 := main_~retValue_acc~25#1; [2025-03-08 05:26:20,463 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1996: #res := ~retValue_acc~18; [2025-03-08 05:26:20,465 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: #res := ~retValue_acc~4; [2025-03-08 05:26:20,469 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~20; [2025-03-08 05:26:20,599 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-03-08 05:26:20,600 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:26:20,619 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:26:20,620 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:26:20,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:26:20 BoogieIcfgContainer [2025-03-08 05:26:20,620 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:26:20,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:26:20,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:26:20,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:26:20,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:26:18" (1/3) ... [2025-03-08 05:26:20,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c38e874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:26:20, skipping insertion in model container [2025-03-08 05:26:20,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:26:19" (2/3) ... [2025-03-08 05:26:20,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c38e874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:26:20, skipping insertion in model container [2025-03-08 05:26:20,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:26:20" (3/3) ... [2025-03-08 05:26:20,629 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product25.cil.c [2025-03-08 05:26:20,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:26:20,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product25.cil.c that has 22 procedures, 539 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:26:20,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:26:20,709 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;@3a511737, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:26:20,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:26:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 428 states have (on average 1.7126168224299065) internal successors, (733), 449 states have internal predecessors, (733), 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-03-08 05:26:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:26:20,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:20,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:20,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:20,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:20,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1348342302, now seen corresponding path program 1 times [2025-03-08 05:26:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552769746] [2025-03-08 05:26:20,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:20,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:26:20,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:26:20,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:20,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:21,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:21,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:21,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552769746] [2025-03-08 05:26:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552769746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004870854] [2025-03-08 05:26:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:21,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:21,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:21,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:21,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:21,264 INFO L87 Difference]: Start difference. First operand has 539 states, 428 states have (on average 1.7126168224299065) internal successors, (733), 449 states have internal predecessors, (733), 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 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:21,376 INFO L93 Difference]: Finished difference Result 1058 states and 1793 transitions. [2025-03-08 05:26:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:21,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-08 05:26:21,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:21,395 INFO L225 Difference]: With dead ends: 1058 [2025-03-08 05:26:21,395 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:26:21,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-03-08 05:26:21,404 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 5 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:21,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2663 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:26:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:26:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 422 states have (on average 1.7109004739336493) internal successors, (722), 441 states have internal predecessors, (722), 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-03-08 05:26:21,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 893 transitions. [2025-03-08 05:26:21,479 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 893 transitions. Word has length 74 [2025-03-08 05:26:21,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:21,480 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 893 transitions. [2025-03-08 05:26:21,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:21,480 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 893 transitions. [2025-03-08 05:26:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:26:21,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:21,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:21,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:26:21,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:21,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:21,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1750869980, now seen corresponding path program 1 times [2025-03-08 05:26:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628446416] [2025-03-08 05:26:21,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:21,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:21,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:26:21,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:26:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:21,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:21,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628446416] [2025-03-08 05:26:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628446416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:21,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342212285] [2025-03-08 05:26:21,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:21,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:21,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:21,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:21,698 INFO L87 Difference]: Start difference. First operand 531 states and 893 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:21,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:21,764 INFO L93 Difference]: Finished difference Result 1044 states and 1763 transitions. [2025-03-08 05:26:21,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:21,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-08 05:26:21,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:21,770 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:26:21,770 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:26:21,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:21,773 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 4 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:21,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2642 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:26:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:26:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 422 states have (on average 1.7085308056872037) internal successors, (721), 441 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-03-08 05:26:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 892 transitions. [2025-03-08 05:26:21,804 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 892 transitions. Word has length 76 [2025-03-08 05:26:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:21,804 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 892 transitions. [2025-03-08 05:26:21,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 892 transitions. [2025-03-08 05:26:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 05:26:21,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:21,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:21,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:26:21,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash 355336806, now seen corresponding path program 1 times [2025-03-08 05:26:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148219435] [2025-03-08 05:26:21,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:21,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 05:26:21,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 05:26:21,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:21,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:21,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148219435] [2025-03-08 05:26:21,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148219435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:21,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:21,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:21,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994681062] [2025-03-08 05:26:21,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:21,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:21,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:21,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:21,977 INFO L87 Difference]: Start difference. First operand 531 states and 892 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:22,034 INFO L93 Difference]: Finished difference Result 1044 states and 1762 transitions. [2025-03-08 05:26:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-03-08 05:26:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:22,041 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:26:22,041 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:26:22,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:22,044 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 3 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:22,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2642 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:22,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:26:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:26:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 422 states have (on average 1.7061611374407584) internal successors, (720), 441 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-03-08 05:26:22,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 891 transitions. [2025-03-08 05:26:22,069 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 891 transitions. Word has length 77 [2025-03-08 05:26:22,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:22,070 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 891 transitions. [2025-03-08 05:26:22,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 891 transitions. [2025-03-08 05:26:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 05:26:22,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:22,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:22,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:26:22,076 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:22,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:22,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1068932327, now seen corresponding path program 1 times [2025-03-08 05:26:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539196204] [2025-03-08 05:26:22,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:22,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:22,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 05:26:22,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 05:26:22,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:22,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:22,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539196204] [2025-03-08 05:26:22,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539196204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:22,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802545292] [2025-03-08 05:26:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:22,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:22,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:22,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:22,246 INFO L87 Difference]: Start difference. First operand 531 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:22,298 INFO L93 Difference]: Finished difference Result 1044 states and 1761 transitions. [2025-03-08 05:26:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-08 05:26:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:22,304 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:26:22,304 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:26:22,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:22,309 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 2 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:22,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2642 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:22,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:26:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:26:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 422 states have (on average 1.7037914691943128) internal successors, (719), 441 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-03-08 05:26:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 890 transitions. [2025-03-08 05:26:22,334 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 890 transitions. Word has length 78 [2025-03-08 05:26:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:22,334 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 890 transitions. [2025-03-08 05:26:22,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 890 transitions. [2025-03-08 05:26:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 05:26:22,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:22,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:26:22,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:22,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:22,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1561251593, now seen corresponding path program 1 times [2025-03-08 05:26:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085329780] [2025-03-08 05:26:22,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:22,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 05:26:22,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 05:26:22,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:22,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085329780] [2025-03-08 05:26:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085329780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776099492] [2025-03-08 05:26:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:22,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:22,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:22,470 INFO L87 Difference]: Start difference. First operand 531 states and 890 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:22,515 INFO L93 Difference]: Finished difference Result 1044 states and 1760 transitions. [2025-03-08 05:26:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:22,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-08 05:26:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:22,522 INFO L225 Difference]: With dead ends: 1044 [2025-03-08 05:26:22,522 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 05:26:22,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:22,526 INFO L435 NwaCegarLoop]: 882 mSDtfsCounter, 1 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:22,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2642 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 05:26:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2025-03-08 05:26:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 422 states have (on average 1.7014218009478672) internal successors, (718), 441 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-03-08 05:26:22,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 889 transitions. [2025-03-08 05:26:22,555 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 889 transitions. Word has length 79 [2025-03-08 05:26:22,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:22,556 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 889 transitions. [2025-03-08 05:26:22,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:22,556 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 889 transitions. [2025-03-08 05:26:22,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:26:22,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:22,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:22,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:26:22,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:22,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -511025750, now seen corresponding path program 1 times [2025-03-08 05:26:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:22,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465063865] [2025-03-08 05:26:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:22,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:26:22,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:26:22,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:22,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:22,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465063865] [2025-03-08 05:26:22,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465063865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:22,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:22,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:26:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634486512] [2025-03-08 05:26:22,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:22,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:26:22,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:22,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:26:22,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:26:22,848 INFO L87 Difference]: Start difference. First operand 531 states and 889 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:22,973 INFO L93 Difference]: Finished difference Result 1010 states and 1692 transitions. [2025-03-08 05:26:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:26:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2025-03-08 05:26:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:22,977 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 05:26:22,977 INFO L226 Difference]: Without dead ends: 546 [2025-03-08 05:26:22,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:22,979 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 91 mSDsluCounter, 6056 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6933 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:22,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6933 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-08 05:26:22,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2025-03-08 05:26:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 432 states have (on average 1.6967592592592593) internal successors, (733), 453 states have internal predecessors, (733), 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-03-08 05:26:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 908 transitions. [2025-03-08 05:26:22,999 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 908 transitions. Word has length 80 [2025-03-08 05:26:22,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:22,999 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 908 transitions. [2025-03-08 05:26:22,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 908 transitions. [2025-03-08 05:26:23,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 05:26:23,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:23,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:23,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:26:23,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash -719724053, now seen corresponding path program 1 times [2025-03-08 05:26:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801018209] [2025-03-08 05:26:23,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:23,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 05:26:23,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 05:26:23,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:23,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:23,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:23,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801018209] [2025-03-08 05:26:23,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801018209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:23,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:23,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400290504] [2025-03-08 05:26:23,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:23,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:23,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:23,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:23,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:23,080 INFO L87 Difference]: Start difference. First operand 544 states and 908 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:23,118 INFO L93 Difference]: Finished difference Result 1062 states and 1786 transitions. [2025-03-08 05:26:23,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:26:23,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-08 05:26:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:23,123 INFO L225 Difference]: With dead ends: 1062 [2025-03-08 05:26:23,123 INFO L226 Difference]: Without dead ends: 525 [2025-03-08 05:26:23,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:23,129 INFO L435 NwaCegarLoop]: 883 mSDtfsCounter, 0 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:23,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2644 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:23,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-08 05:26:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2025-03-08 05:26:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.6923076923076923) internal successors, (704), 435 states have internal predecessors, (704), 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-03-08 05:26:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 875 transitions. [2025-03-08 05:26:23,159 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 875 transitions. Word has length 80 [2025-03-08 05:26:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 875 transitions. [2025-03-08 05:26:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 875 transitions. [2025-03-08 05:26:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 05:26:23,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:23,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:26:23,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:23,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1945917760, now seen corresponding path program 1 times [2025-03-08 05:26:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850586420] [2025-03-08 05:26:23,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:23,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 05:26:23,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 05:26:23,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:23,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:23,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850586420] [2025-03-08 05:26:23,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850586420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:23,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:23,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712820911] [2025-03-08 05:26:23,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:23,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:23,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:23,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:23,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:23,269 INFO L87 Difference]: Start difference. First operand 525 states and 875 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:23,417 INFO L93 Difference]: Finished difference Result 1007 states and 1684 transitions. [2025-03-08 05:26:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 81 [2025-03-08 05:26:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:23,421 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:26:23,421 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:26:23,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:23,424 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 55 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:23,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4131 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:23,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:26:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 525. [2025-03-08 05:26:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.6826923076923077) internal successors, (700), 435 states have internal predecessors, (700), 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-03-08 05:26:23,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 871 transitions. [2025-03-08 05:26:23,446 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 871 transitions. Word has length 81 [2025-03-08 05:26:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:23,446 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 871 transitions. [2025-03-08 05:26:23,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,446 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 871 transitions. [2025-03-08 05:26:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 05:26:23,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:23,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:23,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:26:23,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:23,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1842426637, now seen corresponding path program 1 times [2025-03-08 05:26:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452552612] [2025-03-08 05:26:23,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:23,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 05:26:23,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 05:26:23,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:23,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:23,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:23,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452552612] [2025-03-08 05:26:23,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452552612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:23,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:23,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:23,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142692547] [2025-03-08 05:26:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:23,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:23,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:23,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:23,580 INFO L87 Difference]: Start difference. First operand 525 states and 871 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:23,719 INFO L93 Difference]: Finished difference Result 1007 states and 1680 transitions. [2025-03-08 05:26:23,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2025-03-08 05:26:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:23,725 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:26:23,726 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:26:23,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:23,728 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 54 mSDsluCounter, 3299 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:23,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4131 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:26:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 525. [2025-03-08 05:26:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.6730769230769231) internal successors, (696), 435 states have internal predecessors, (696), 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-03-08 05:26:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 867 transitions. [2025-03-08 05:26:23,744 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 867 transitions. Word has length 82 [2025-03-08 05:26:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 867 transitions. [2025-03-08 05:26:23,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 867 transitions. [2025-03-08 05:26:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:26:23,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:23,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:23,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:26:23,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:23,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash 125218301, now seen corresponding path program 1 times [2025-03-08 05:26:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:23,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220242512] [2025-03-08 05:26:23,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:23,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:23,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:26:23,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:26:23,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:23,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:23,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:23,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220242512] [2025-03-08 05:26:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220242512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:23,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944635979] [2025-03-08 05:26:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:23,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:23,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:23,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:23,857 INFO L87 Difference]: Start difference. First operand 525 states and 867 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:23,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:23,983 INFO L93 Difference]: Finished difference Result 1007 states and 1676 transitions. [2025-03-08 05:26:23,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2025-03-08 05:26:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:23,988 INFO L225 Difference]: With dead ends: 1007 [2025-03-08 05:26:23,988 INFO L226 Difference]: Without dead ends: 534 [2025-03-08 05:26:23,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:23,991 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 53 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4113 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:23,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4113 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:23,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-08 05:26:24,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 525. [2025-03-08 05:26:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 416 states have (on average 1.6634615384615385) internal successors, (692), 435 states have internal predecessors, (692), 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-03-08 05:26:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 863 transitions. [2025-03-08 05:26:24,023 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 863 transitions. Word has length 83 [2025-03-08 05:26:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:24,023 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 863 transitions. [2025-03-08 05:26:24,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:24,023 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 863 transitions. [2025-03-08 05:26:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 05:26:24,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:24,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:24,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:26:24,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:24,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1958800878, now seen corresponding path program 1 times [2025-03-08 05:26:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:24,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17830704] [2025-03-08 05:26:24,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:24,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:24,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 05:26:24,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 05:26:24,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:24,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:24,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:24,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17830704] [2025-03-08 05:26:24,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17830704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:24,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:24,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:24,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314660288] [2025-03-08 05:26:24,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:24,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:24,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:24,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:24,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:24,133 INFO L87 Difference]: Start difference. First operand 525 states and 863 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:24,186 INFO L93 Difference]: Finished difference Result 998 states and 1658 transitions. [2025-03-08 05:26:24,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:26:24,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2025-03-08 05:26:24,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:24,190 INFO L225 Difference]: With dead ends: 998 [2025-03-08 05:26:24,190 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:26:24,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:24,192 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 84 mSDsluCounter, 4187 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:24,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5039 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:24,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:26:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:26:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 395 states have (on average 1.6658227848101266) internal successors, (658), 414 states have internal predecessors, (658), 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-03-08 05:26:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 829 transitions. [2025-03-08 05:26:24,206 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 829 transitions. Word has length 83 [2025-03-08 05:26:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:24,207 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 829 transitions. [2025-03-08 05:26:24,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 829 transitions. [2025-03-08 05:26:24,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 05:26:24,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:24,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:24,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:26:24,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash -247910640, now seen corresponding path program 1 times [2025-03-08 05:26:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421820583] [2025-03-08 05:26:24,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:24,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 05:26:24,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 05:26:24,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:24,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:24,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421820583] [2025-03-08 05:26:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421820583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:24,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843174801] [2025-03-08 05:26:24,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:24,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:24,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:24,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:24,326 INFO L87 Difference]: Start difference. First operand 504 states and 829 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:24,390 INFO L93 Difference]: Finished difference Result 977 states and 1624 transitions. [2025-03-08 05:26:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 84 [2025-03-08 05:26:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:24,394 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:26:24,394 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:26:24,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:24,396 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 17 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4051 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:24,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4051 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:26:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:26:24,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 395 states have (on average 1.6632911392405063) internal successors, (657), 414 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-03-08 05:26:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 828 transitions. [2025-03-08 05:26:24,413 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 828 transitions. Word has length 84 [2025-03-08 05:26:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:24,413 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 828 transitions. [2025-03-08 05:26:24,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 828 transitions. [2025-03-08 05:26:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 05:26:24,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:24,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:24,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:26:24,415 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:24,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash -170585798, now seen corresponding path program 1 times [2025-03-08 05:26:24,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:24,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883817498] [2025-03-08 05:26:24,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:24,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:24,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 05:26:24,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 05:26:24,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:24,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:24,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:24,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883817498] [2025-03-08 05:26:24,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883817498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:24,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:24,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:24,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983722661] [2025-03-08 05:26:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:24,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:24,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:24,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:24,529 INFO L87 Difference]: Start difference. First operand 504 states and 828 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:24,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:24,592 INFO L93 Difference]: Finished difference Result 977 states and 1623 transitions. [2025-03-08 05:26:24,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:26:24,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 85 [2025-03-08 05:26:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:24,597 INFO L225 Difference]: With dead ends: 977 [2025-03-08 05:26:24,597 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:26:24,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:24,600 INFO L435 NwaCegarLoop]: 812 mSDtfsCounter, 16 mSDsluCounter, 3239 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4051 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:24,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4051 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:26:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:26:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 395 states have (on average 1.660759493670886) internal successors, (656), 414 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-03-08 05:26:24,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 827 transitions. [2025-03-08 05:26:24,618 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 827 transitions. Word has length 85 [2025-03-08 05:26:24,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:24,618 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 827 transitions. [2025-03-08 05:26:24,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 05:26:24,618 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 827 transitions. [2025-03-08 05:26:24,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-08 05:26:24,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:24,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:24,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:26:24,621 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:24,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:24,621 INFO L85 PathProgramCache]: Analyzing trace with hash 985904429, now seen corresponding path program 1 times [2025-03-08 05:26:24,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:24,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230215558] [2025-03-08 05:26:24,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:24,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:24,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-08 05:26:24,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-08 05:26:24,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:24,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:24,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:24,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230215558] [2025-03-08 05:26:24,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230215558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:24,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:24,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:26:24,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416460832] [2025-03-08 05:26:24,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:24,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:26:24,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:24,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:26:24,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:24,807 INFO L87 Difference]: Start difference. First operand 504 states and 827 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:24,894 INFO L93 Difference]: Finished difference Result 971 states and 1611 transitions. [2025-03-08 05:26:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:26:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 86 [2025-03-08 05:26:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:24,898 INFO L225 Difference]: With dead ends: 971 [2025-03-08 05:26:24,898 INFO L226 Difference]: Without dead ends: 504 [2025-03-08 05:26:24,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:24,900 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 6 mSDsluCounter, 6466 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7277 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:24,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7277 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2025-03-08 05:26:24,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2025-03-08 05:26:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 395 states have (on average 1.6582278481012658) internal successors, (655), 414 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-03-08 05:26:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 826 transitions. [2025-03-08 05:26:24,916 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 826 transitions. Word has length 86 [2025-03-08 05:26:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:24,916 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 826 transitions. [2025-03-08 05:26:24,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 826 transitions. [2025-03-08 05:26:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 05:26:24,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:24,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:24,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:26:24,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:24,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash -35468729, now seen corresponding path program 1 times [2025-03-08 05:26:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557670084] [2025-03-08 05:26:24,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:24,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 05:26:24,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 05:26:24,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:24,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:25,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557670084] [2025-03-08 05:26:25,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557670084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:25,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:25,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:26:25,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425169508] [2025-03-08 05:26:25,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:25,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:26:25,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:25,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:26:25,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:25,109 INFO L87 Difference]: Start difference. First operand 504 states and 826 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:26,530 INFO L93 Difference]: Finished difference Result 967 states and 1623 transitions. [2025-03-08 05:26:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:26,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2025-03-08 05:26:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:26,534 INFO L225 Difference]: With dead ends: 967 [2025-03-08 05:26:26,534 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:26:26,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:26:26,536 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1276 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:26,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1584 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 05:26:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:26:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:26:26,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 398 states have (on average 1.6532663316582914) internal successors, (658), 417 states have internal predecessors, (658), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (99), 82 states have call predecessors, (99), 83 states have call successors, (99) [2025-03-08 05:26:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 845 transitions. [2025-03-08 05:26:26,555 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 845 transitions. Word has length 87 [2025-03-08 05:26:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:26,555 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 845 transitions. [2025-03-08 05:26:26,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-08 05:26:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 845 transitions. [2025-03-08 05:26:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-08 05:26:26,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:26,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:26,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:26:26,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:26,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:26,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1780775156, now seen corresponding path program 1 times [2025-03-08 05:26:26,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:26,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944178107] [2025-03-08 05:26:26,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:26,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:26,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-08 05:26:26,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-08 05:26:26,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:26,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:26,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944178107] [2025-03-08 05:26:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944178107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461284083] [2025-03-08 05:26:26,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:26,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:26,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:26,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:26,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:26,659 INFO L87 Difference]: Start difference. First operand 508 states and 845 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:26:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:29,325 INFO L93 Difference]: Finished difference Result 1820 states and 3123 transitions. [2025-03-08 05:26:29,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:26:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2025-03-08 05:26:29,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:29,334 INFO L225 Difference]: With dead ends: 1820 [2025-03-08 05:26:29,334 INFO L226 Difference]: Without dead ends: 1357 [2025-03-08 05:26:29,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-08 05:26:29,338 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 2307 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 4656 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 5232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 4656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:29,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 2570 Invalid, 5232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 4656 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-08 05:26:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-03-08 05:26:29,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1300. [2025-03-08 05:26:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1016 states have (on average 1.6663385826771653) internal successors, (1693), 1064 states have internal predecessors, (1693), 229 states have call successors, (229), 54 states have call predecessors, (229), 54 states have return successors, (244), 218 states have call predecessors, (244), 224 states have call successors, (244) [2025-03-08 05:26:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 2166 transitions. [2025-03-08 05:26:29,403 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 2166 transitions. Word has length 88 [2025-03-08 05:26:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:29,403 INFO L471 AbstractCegarLoop]: Abstraction has 1300 states and 2166 transitions. [2025-03-08 05:26:29,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:26:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 2166 transitions. [2025-03-08 05:26:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:26:29,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:29,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:29,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:26:29,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:29,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash 414769726, now seen corresponding path program 1 times [2025-03-08 05:26:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:29,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457034642] [2025-03-08 05:26:29,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:29,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:26:29,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:26:29,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:29,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457034642] [2025-03-08 05:26:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457034642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623924363] [2025-03-08 05:26:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:29,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:29,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:29,535 INFO L87 Difference]: Start difference. First operand 1300 states and 2166 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:26:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:32,695 INFO L93 Difference]: Finished difference Result 6132 states and 10548 transitions. [2025-03-08 05:26:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:26:32,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-08 05:26:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:32,735 INFO L225 Difference]: With dead ends: 6132 [2025-03-08 05:26:32,736 INFO L226 Difference]: Without dead ends: 4877 [2025-03-08 05:26:32,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:26:32,746 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 3070 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 5261 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3201 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 6066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 5261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:32,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3201 Valid, 2843 Invalid, 6066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 5261 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 05:26:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4877 states. [2025-03-08 05:26:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4877 to 4352. [2025-03-08 05:26:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 3231 states have (on average 1.6632621479418137) internal successors, (5374), 3443 states have internal predecessors, (5374), 958 states have call successors, (958), 146 states have call predecessors, (958), 162 states have return successors, (1152), 936 states have call predecessors, (1152), 953 states have call successors, (1152) [2025-03-08 05:26:33,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 7484 transitions. [2025-03-08 05:26:33,004 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 7484 transitions. Word has length 90 [2025-03-08 05:26:33,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:33,005 INFO L471 AbstractCegarLoop]: Abstraction has 4352 states and 7484 transitions. [2025-03-08 05:26:33,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:26:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 7484 transitions. [2025-03-08 05:26:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 05:26:33,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:33,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:33,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:26:33,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:33,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:33,009 INFO L85 PathProgramCache]: Analyzing trace with hash -614589572, now seen corresponding path program 1 times [2025-03-08 05:26:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:33,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199177554] [2025-03-08 05:26:33,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:33,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 05:26:33,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 05:26:33,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:33,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:33,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:33,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199177554] [2025-03-08 05:26:33,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199177554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:33,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:33,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168467368] [2025-03-08 05:26:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:33,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:33,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:33,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:33,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:33,168 INFO L87 Difference]: Start difference. First operand 4352 states and 7484 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:26:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:35,270 INFO L93 Difference]: Finished difference Result 11765 states and 20374 transitions. [2025-03-08 05:26:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 05:26:35,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 90 [2025-03-08 05:26:35,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:35,328 INFO L225 Difference]: With dead ends: 11765 [2025-03-08 05:26:35,329 INFO L226 Difference]: Without dead ends: 8607 [2025-03-08 05:26:35,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-08 05:26:35,346 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 2340 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 3543 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2419 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 4026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 3543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:35,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2419 Valid, 1693 Invalid, 4026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 3543 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 05:26:35,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8607 states. [2025-03-08 05:26:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8607 to 8100. [2025-03-08 05:26:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8100 states, 6052 states have (on average 1.661764705882353) internal successors, (10057), 6442 states have internal predecessors, (10057), 1720 states have call successors, (1720), 269 states have call predecessors, (1720), 327 states have return successors, (2193), 1679 states have call predecessors, (2193), 1715 states have call successors, (2193) [2025-03-08 05:26:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8100 states to 8100 states and 13970 transitions. [2025-03-08 05:26:35,739 INFO L78 Accepts]: Start accepts. Automaton has 8100 states and 13970 transitions. Word has length 90 [2025-03-08 05:26:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:35,740 INFO L471 AbstractCegarLoop]: Abstraction has 8100 states and 13970 transitions. [2025-03-08 05:26:35,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-08 05:26:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 8100 states and 13970 transitions. [2025-03-08 05:26:35,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:26:35,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:35,742 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:35,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:26:35,742 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:35,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:35,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1443574863, now seen corresponding path program 1 times [2025-03-08 05:26:35,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745931515] [2025-03-08 05:26:35,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:35,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:35,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:26:35,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:26:35,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:35,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745931515] [2025-03-08 05:26:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745931515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:26:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073749684] [2025-03-08 05:26:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:35,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:35,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:35,901 INFO L87 Difference]: Start difference. First operand 8100 states and 13970 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:26:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:36,197 INFO L93 Difference]: Finished difference Result 14928 states and 25814 transitions. [2025-03-08 05:26:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-03-08 05:26:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:36,252 INFO L225 Difference]: With dead ends: 14928 [2025-03-08 05:26:36,252 INFO L226 Difference]: Without dead ends: 8187 [2025-03-08 05:26:36,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:36,280 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 0 mSDsluCounter, 2442 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:36,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3266 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2025-03-08 05:26:36,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8173. [2025-03-08 05:26:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8173 states, 6108 states have (on average 1.6552062868369353) internal successors, (10110), 6497 states have internal predecessors, (10110), 1717 states have call successors, (1717), 269 states have call predecessors, (1717), 347 states have return successors, (2256), 1697 states have call predecessors, (2256), 1712 states have call successors, (2256) [2025-03-08 05:26:36,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8173 states to 8173 states and 14083 transitions. [2025-03-08 05:26:36,780 INFO L78 Accepts]: Start accepts. Automaton has 8173 states and 14083 transitions. Word has length 95 [2025-03-08 05:26:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:36,780 INFO L471 AbstractCegarLoop]: Abstraction has 8173 states and 14083 transitions. [2025-03-08 05:26:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 05:26:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8173 states and 14083 transitions. [2025-03-08 05:26:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 05:26:36,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:36,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:36,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:26:36,783 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:36,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash 319506997, now seen corresponding path program 1 times [2025-03-08 05:26:36,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:36,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230953138] [2025-03-08 05:26:36,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:36,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 05:26:36,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 05:26:36,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:36,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:26:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230953138] [2025-03-08 05:26:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230953138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:36,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368465610] [2025-03-08 05:26:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:36,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:36,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:36,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:36,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:36,931 INFO L87 Difference]: Start difference. First operand 8173 states and 14083 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:26:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:37,422 INFO L93 Difference]: Finished difference Result 16154 states and 28287 transitions. [2025-03-08 05:26:37,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:37,423 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2025-03-08 05:26:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:37,480 INFO L225 Difference]: With dead ends: 16154 [2025-03-08 05:26:37,480 INFO L226 Difference]: Without dead ends: 8321 [2025-03-08 05:26:37,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:37,515 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 225 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4077 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:37,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4077 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:26:37,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8321 states. [2025-03-08 05:26:37,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8321 to 8197. [2025-03-08 05:26:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 6129 states have (on average 1.6333822809593734) internal successors, (10011), 6521 states have internal predecessors, (10011), 1717 states have call successors, (1717), 269 states have call predecessors, (1717), 350 states have return successors, (2268), 1697 states have call predecessors, (2268), 1712 states have call successors, (2268) [2025-03-08 05:26:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 13996 transitions. [2025-03-08 05:26:37,903 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 13996 transitions. Word has length 102 [2025-03-08 05:26:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:37,904 INFO L471 AbstractCegarLoop]: Abstraction has 8197 states and 13996 transitions. [2025-03-08 05:26:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 05:26:37,905 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 13996 transitions. [2025-03-08 05:26:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-08 05:26:37,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:37,907 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:37,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:26:37,907 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:37,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1557186471, now seen corresponding path program 1 times [2025-03-08 05:26:37,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:37,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242366854] [2025-03-08 05:26:37,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:37,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-08 05:26:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-08 05:26:37,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:37,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 05:26:38,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:38,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242366854] [2025-03-08 05:26:38,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242366854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:38,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:38,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:38,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848078783] [2025-03-08 05:26:38,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:38,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:38,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:38,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:38,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:38,038 INFO L87 Difference]: Start difference. First operand 8197 states and 13996 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:26:39,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:39,972 INFO L93 Difference]: Finished difference Result 15757 states and 26952 transitions. [2025-03-08 05:26:39,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:26:39,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 107 [2025-03-08 05:26:39,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:40,038 INFO L225 Difference]: With dead ends: 15757 [2025-03-08 05:26:40,039 INFO L226 Difference]: Without dead ends: 8935 [2025-03-08 05:26:40,069 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-03-08 05:26:40,071 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 2062 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:40,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 1631 Invalid, 3502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 05:26:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8935 states. [2025-03-08 05:26:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8935 to 8432. [2025-03-08 05:26:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8432 states, 6304 states have (on average 1.6227791878172588) internal successors, (10230), 6714 states have internal predecessors, (10230), 1737 states have call successors, (1737), 294 states have call predecessors, (1737), 390 states have return successors, (2360), 1715 states have call predecessors, (2360), 1732 states have call successors, (2360) [2025-03-08 05:26:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8432 states to 8432 states and 14327 transitions. [2025-03-08 05:26:40,551 INFO L78 Accepts]: Start accepts. Automaton has 8432 states and 14327 transitions. Word has length 107 [2025-03-08 05:26:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:40,552 INFO L471 AbstractCegarLoop]: Abstraction has 8432 states and 14327 transitions. [2025-03-08 05:26:40,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 05:26:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states and 14327 transitions. [2025-03-08 05:26:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:40,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:40,555 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:40,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:26:40,555 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:40,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1837464849, now seen corresponding path program 1 times [2025-03-08 05:26:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442278602] [2025-03-08 05:26:40,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:40,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:40,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:26:40,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:40,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442278602] [2025-03-08 05:26:40,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442278602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:40,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:40,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:26:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338566484] [2025-03-08 05:26:40,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:40,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:26:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:40,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:26:40,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:40,664 INFO L87 Difference]: Start difference. First operand 8432 states and 14327 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 05:26:41,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:41,259 INFO L93 Difference]: Finished difference Result 19036 states and 32499 transitions. [2025-03-08 05:26:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-08 05:26:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:41,333 INFO L225 Difference]: With dead ends: 19036 [2025-03-08 05:26:41,333 INFO L226 Difference]: Without dead ends: 11979 [2025-03-08 05:26:41,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:26:41,369 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 757 mSDsluCounter, 3461 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 4796 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:41,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 4796 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11979 states. [2025-03-08 05:26:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11979 to 11305. [2025-03-08 05:26:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11305 states, 8456 states have (on average 1.6323320719016083) internal successors, (13803), 8993 states have internal predecessors, (13803), 2352 states have call successors, (2352), 381 states have call predecessors, (2352), 496 states have return successors, (3131), 2339 states have call predecessors, (3131), 2347 states have call successors, (3131) [2025-03-08 05:26:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11305 states to 11305 states and 19286 transitions. [2025-03-08 05:26:41,912 INFO L78 Accepts]: Start accepts. Automaton has 11305 states and 19286 transitions. Word has length 112 [2025-03-08 05:26:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:41,913 INFO L471 AbstractCegarLoop]: Abstraction has 11305 states and 19286 transitions. [2025-03-08 05:26:41,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-08 05:26:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 11305 states and 19286 transitions. [2025-03-08 05:26:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:26:41,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:41,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:41,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:26:41,915 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:41,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:41,916 INFO L85 PathProgramCache]: Analyzing trace with hash 419446158, now seen corresponding path program 1 times [2025-03-08 05:26:41,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:41,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680327058] [2025-03-08 05:26:41,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:41,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:26:41,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:26:41,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:41,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:42,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:42,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680327058] [2025-03-08 05:26:42,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680327058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:42,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:42,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:26:42,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767936360] [2025-03-08 05:26:42,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:42,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:26:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:42,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:26:42,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:26:42,033 INFO L87 Difference]: Start difference. First operand 11305 states and 19286 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:26:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:42,653 INFO L93 Difference]: Finished difference Result 11429 states and 19507 transitions. [2025-03-08 05:26:42,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:42,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-08 05:26:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:42,720 INFO L225 Difference]: With dead ends: 11429 [2025-03-08 05:26:42,721 INFO L226 Difference]: Without dead ends: 11414 [2025-03-08 05:26:42,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:42,731 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 884 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 2290 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:42,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 2290 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:26:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11414 states. [2025-03-08 05:26:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11414 to 11313. [2025-03-08 05:26:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11313 states, 8464 states have (on average 1.631734404536862) internal successors, (13811), 9001 states have internal predecessors, (13811), 2352 states have call successors, (2352), 381 states have call predecessors, (2352), 496 states have return successors, (3131), 2339 states have call predecessors, (3131), 2347 states have call successors, (3131) [2025-03-08 05:26:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11313 states to 11313 states and 19294 transitions. [2025-03-08 05:26:43,167 INFO L78 Accepts]: Start accepts. Automaton has 11313 states and 19294 transitions. Word has length 112 [2025-03-08 05:26:43,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:43,167 INFO L471 AbstractCegarLoop]: Abstraction has 11313 states and 19294 transitions. [2025-03-08 05:26:43,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 05:26:43,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11313 states and 19294 transitions. [2025-03-08 05:26:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 05:26:43,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:43,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:26:43,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:26:43,170 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:43,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 846231020, now seen corresponding path program 1 times [2025-03-08 05:26:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210960134] [2025-03-08 05:26:43,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:43,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 05:26:43,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 05:26:43,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:43,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 05:26:43,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:43,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210960134] [2025-03-08 05:26:43,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210960134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:43,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:43,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:26:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341132208] [2025-03-08 05:26:43,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:43,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:26:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:43,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:26:43,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:43,363 INFO L87 Difference]: Start difference. First operand 11313 states and 19294 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:26:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:43,683 INFO L93 Difference]: Finished difference Result 11328 states and 19312 transitions. [2025-03-08 05:26:43,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:43,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-08 05:26:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:43,762 INFO L225 Difference]: With dead ends: 11328 [2025-03-08 05:26:43,762 INFO L226 Difference]: Without dead ends: 11313 [2025-03-08 05:26:43,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:26:43,774 INFO L435 NwaCegarLoop]: 811 mSDtfsCounter, 0 mSDsluCounter, 4049 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4860 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:43,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4860 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:26:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11313 states. [2025-03-08 05:26:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11313 to 11313. [2025-03-08 05:26:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11313 states, 8464 states have (on average 1.630789224952741) internal successors, (13803), 9001 states have internal predecessors, (13803), 2352 states have call successors, (2352), 381 states have call predecessors, (2352), 496 states have return successors, (3131), 2339 states have call predecessors, (3131), 2347 states have call successors, (3131) [2025-03-08 05:26:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11313 states to 11313 states and 19286 transitions. [2025-03-08 05:26:44,401 INFO L78 Accepts]: Start accepts. Automaton has 11313 states and 19286 transitions. Word has length 118 [2025-03-08 05:26:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:44,402 INFO L471 AbstractCegarLoop]: Abstraction has 11313 states and 19286 transitions. [2025-03-08 05:26:44,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-08 05:26:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11313 states and 19286 transitions. [2025-03-08 05:26:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:26:44,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:44,405 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] [2025-03-08 05:26:44,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:26:44,405 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:44,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -507132271, now seen corresponding path program 1 times [2025-03-08 05:26:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342328377] [2025-03-08 05:26:44,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:44,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:26:44,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:26:44,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:44,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 05:26:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342328377] [2025-03-08 05:26:44,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342328377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:44,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:26:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979459659] [2025-03-08 05:26:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:44,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:26:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:44,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:26:44,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:26:44,641 INFO L87 Difference]: Start difference. First operand 11313 states and 19286 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 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-03-08 05:26:46,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:46,461 INFO L93 Difference]: Finished difference Result 22611 states and 38663 transitions. [2025-03-08 05:26:46,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:26:46,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 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 128 [2025-03-08 05:26:46,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:46,542 INFO L225 Difference]: With dead ends: 22611 [2025-03-08 05:26:46,543 INFO L226 Difference]: Without dead ends: 11355 [2025-03-08 05:26:46,594 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-03-08 05:26:46,594 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 1224 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 2897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:46,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 1575 Invalid, 2897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 05:26:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2025-03-08 05:26:47,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 11313. [2025-03-08 05:26:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11313 states, 8464 states have (on average 1.62984404536862) internal successors, (13795), 9001 states have internal predecessors, (13795), 2352 states have call successors, (2352), 381 states have call predecessors, (2352), 496 states have return successors, (3131), 2339 states have call predecessors, (3131), 2347 states have call successors, (3131) [2025-03-08 05:26:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11313 states to 11313 states and 19278 transitions. [2025-03-08 05:26:47,202 INFO L78 Accepts]: Start accepts. Automaton has 11313 states and 19278 transitions. Word has length 128 [2025-03-08 05:26:47,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:47,203 INFO L471 AbstractCegarLoop]: Abstraction has 11313 states and 19278 transitions. [2025-03-08 05:26:47,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 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-03-08 05:26:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 11313 states and 19278 transitions. [2025-03-08 05:26:47,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:26:47,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:47,206 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] [2025-03-08 05:26:47,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:26:47,206 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:47,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:47,206 INFO L85 PathProgramCache]: Analyzing trace with hash -402411208, now seen corresponding path program 1 times [2025-03-08 05:26:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769754585] [2025-03-08 05:26:47,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:47,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:26:47,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:26:47,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:47,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:26:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769754585] [2025-03-08 05:26:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769754585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:47,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:47,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:26:47,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268243900] [2025-03-08 05:26:47,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:47,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:26:47,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:47,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:26:47,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:26:47,440 INFO L87 Difference]: Start difference. First operand 11313 states and 19278 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:26:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:50,223 INFO L93 Difference]: Finished difference Result 24353 states and 41204 transitions. [2025-03-08 05:26:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 05:26:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 139 [2025-03-08 05:26:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:50,317 INFO L225 Difference]: With dead ends: 24353 [2025-03-08 05:26:50,317 INFO L226 Difference]: Without dead ends: 14238 [2025-03-08 05:26:50,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 05:26:50,362 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 2060 mSDsluCounter, 2909 mSDsCounter, 0 mSdLazyCounter, 6740 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 7162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 6740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:50,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 3426 Invalid, 7162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 6740 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 05:26:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14238 states. [2025-03-08 05:26:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14238 to 13050. [2025-03-08 05:26:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13050 states, 9836 states have (on average 1.6114274095160634) internal successors, (15850), 10438 states have internal predecessors, (15850), 2580 states have call successors, (2580), 470 states have call predecessors, (2580), 633 states have return successors, (3467), 2543 states have call predecessors, (3467), 2575 states have call successors, (3467) [2025-03-08 05:26:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13050 states to 13050 states and 21897 transitions. [2025-03-08 05:26:51,019 INFO L78 Accepts]: Start accepts. Automaton has 13050 states and 21897 transitions. Word has length 139 [2025-03-08 05:26:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 13050 states and 21897 transitions. [2025-03-08 05:26:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 5 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2025-03-08 05:26:51,020 INFO L276 IsEmpty]: Start isEmpty. Operand 13050 states and 21897 transitions. [2025-03-08 05:26:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:26:51,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:51,022 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] [2025-03-08 05:26:51,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:26:51,024 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:51,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2072924777, now seen corresponding path program 1 times [2025-03-08 05:26:51,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:51,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357681192] [2025-03-08 05:26:51,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:51,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:26:51,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:26:51,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:51,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:26:51,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:51,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357681192] [2025-03-08 05:26:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357681192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355801167] [2025-03-08 05:26:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:51,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:51,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:51,120 INFO L87 Difference]: Start difference. First operand 13050 states and 21897 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, (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-03-08 05:26:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:53,319 INFO L93 Difference]: Finished difference Result 42969 states and 74337 transitions. [2025-03-08 05:26:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:53,319 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, (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 139 [2025-03-08 05:26:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:26:53,479 INFO L225 Difference]: With dead ends: 42969 [2025-03-08 05:26:53,479 INFO L226 Difference]: Without dead ends: 29964 [2025-03-08 05:26:53,527 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-03-08 05:26:53,528 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 1827 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:26:53,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 914 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:26:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29964 states. [2025-03-08 05:26:54,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29964 to 29074. [2025-03-08 05:26:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29074 states, 21346 states have (on average 1.6044223742153096) internal successors, (34248), 22799 states have internal predecessors, (34248), 6399 states have call successors, (6399), 935 states have call predecessors, (6399), 1328 states have return successors, (9940), 6353 states have call predecessors, (9940), 6394 states have call successors, (9940) [2025-03-08 05:26:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29074 states to 29074 states and 50587 transitions. [2025-03-08 05:26:54,855 INFO L78 Accepts]: Start accepts. Automaton has 29074 states and 50587 transitions. Word has length 139 [2025-03-08 05:26:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:26:54,855 INFO L471 AbstractCegarLoop]: Abstraction has 29074 states and 50587 transitions. [2025-03-08 05:26:54,855 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, (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-03-08 05:26:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 29074 states and 50587 transitions. [2025-03-08 05:26:54,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 05:26:54,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:26:54,859 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] [2025-03-08 05:26:54,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 05:26:54,859 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:26:54,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:26:54,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1893473592, now seen corresponding path program 1 times [2025-03-08 05:26:54,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:26:54,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719436326] [2025-03-08 05:26:54,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:26:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:26:54,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 05:26:54,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 05:26:54,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:26:54,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:26:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:26:54,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:26:54,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719436326] [2025-03-08 05:26:54,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719436326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:26:54,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:26:54,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:26:54,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906149781] [2025-03-08 05:26:54,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:26:54,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:26:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:26:54,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:26:54,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:26:54,947 INFO L87 Difference]: Start difference. First operand 29074 states and 50587 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-03-08 05:26:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:26:59,910 INFO L93 Difference]: Finished difference Result 97584 states and 177226 transitions. [2025-03-08 05:26:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:26:59,910 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), 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 138 [2025-03-08 05:26:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:27:00,341 INFO L225 Difference]: With dead ends: 97584 [2025-03-08 05:27:00,341 INFO L226 Difference]: Without dead ends: 68555 [2025-03-08 05:27:00,462 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-03-08 05:27:00,462 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1837 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:27:00,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 880 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 05:27:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68555 states. [2025-03-08 05:27:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68555 to 66591. [2025-03-08 05:27:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66591 states, 47476 states have (on average 1.595627264301963) internal successors, (75754), 51044 states have internal predecessors, (75754), 16315 states have call successors, (16315), 1865 states have call predecessors, (16315), 2799 states have return successors, (29770), 16297 states have call predecessors, (29770), 16310 states have call successors, (29770) [2025-03-08 05:27:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66591 states to 66591 states and 121839 transitions. [2025-03-08 05:27:05,160 INFO L78 Accepts]: Start accepts. Automaton has 66591 states and 121839 transitions. Word has length 138 [2025-03-08 05:27:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:27:05,160 INFO L471 AbstractCegarLoop]: Abstraction has 66591 states and 121839 transitions. [2025-03-08 05:27:05,160 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), 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-03-08 05:27:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 66591 states and 121839 transitions. [2025-03-08 05:27:05,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:27:05,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:27:05,167 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] [2025-03-08 05:27:05,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 05:27:05,167 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:27:05,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:27:05,168 INFO L85 PathProgramCache]: Analyzing trace with hash 778773297, now seen corresponding path program 1 times [2025-03-08 05:27:05,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:27:05,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067952080] [2025-03-08 05:27:05,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:27:05,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:27:05,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:27:05,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:27:05,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:27:05,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:27:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:27:05,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:27:05,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067952080] [2025-03-08 05:27:05,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067952080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:27:05,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:27:05,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:27:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759286440] [2025-03-08 05:27:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:27:05,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:27:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:27:05,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:27:05,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:27:05,258 INFO L87 Difference]: Start difference. First operand 66591 states and 121839 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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)