./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec9_product26.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 d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:28:48,035 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:28:48,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:28:48,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:28:48,093 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:28:48,111 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:28:48,112 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:28:48,112 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:28:48,113 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:28:48,113 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:28:48,113 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:28:48,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:28:48,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:28:48,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:28:48,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:28:48,115 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:28:48,115 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:28:48,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:28:48,116 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:28:48,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:48,116 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:28:48,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:28:48,116 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:28:48,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:28:48,117 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 -> d5d3c0f581b3d52ccfb3e43d6fb6458a66cd40c307750c0d7336040b60b78e76 [2025-03-08 05:28:48,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:28:48,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:28:48,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:28:48,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:28:48,391 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:28:48,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2025-03-08 05:28:49,652 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe52bc97/85409389b3bb4dc0a8ae3ea4b1ae50c2/FLAG5db93361c [2025-03-08 05:28:49,950 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:28:49,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c [2025-03-08 05:28:49,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe52bc97/85409389b3bb4dc0a8ae3ea4b1ae50c2/FLAG5db93361c [2025-03-08 05:28:49,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe52bc97/85409389b3bb4dc0a8ae3ea4b1ae50c2 [2025-03-08 05:28:49,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:28:49,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:28:49,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:49,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:28:50,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:28:50,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:49" (1/1) ... [2025-03-08 05:28:50,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b07ac3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50, skipping insertion in model container [2025-03-08 05:28:50,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:28:49" (1/1) ... [2025-03-08 05:28:50,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:28:50,297 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2025-03-08 05:28:50,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:50,372 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:28:50,380 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-08 05:28:50,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [414] [2025-03-08 05:28:50,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [428] [2025-03-08 05:28:50,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [594] [2025-03-08 05:28:50,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2119] [2025-03-08 05:28:50,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2128] [2025-03-08 05:28:50,381 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2790] [2025-03-08 05:28:50,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3145] [2025-03-08 05:28:50,382 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3236] [2025-03-08 05:28:50,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3271] [2025-03-08 05:28:50,450 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product26.cil.c[46529,46542] [2025-03-08 05:28:50,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:28:50,500 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:28:50,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50 WrapperNode [2025-03-08 05:28:50,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:28:50,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:50,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:28:50,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:28:50,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,530 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,558 INFO L138 Inliner]: procedures = 93, calls = 337, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 810 [2025-03-08 05:28:50,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:28:50,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:28:50,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:28:50,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:28:50,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,575 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,609 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-08 05:28:50,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:28:50,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:28:50,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:28:50,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:28:50,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (1/1) ... [2025-03-08 05:28:50,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:28:50,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:28:50,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:28:50,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:28:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:28:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-08 05:28:50,709 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-08 05:28:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-08 05:28:50,709 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-08 05:28:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-08 05:28:50,709 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-08 05:28:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-08 05:28:50,710 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-08 05:28:50,710 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-08 05:28:50,710 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-08 05:28:50,710 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-08 05:28:50,710 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-08 05:28:50,710 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-08 05:28:50,710 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-08 05:28:50,710 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__empty [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__empty [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-08 05:28:50,711 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:28:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:28:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:28:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:28:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 05:28:50,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-08 05:28:50,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-08 05:28:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-08 05:28:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-08 05:28:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-08 05:28:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-08 05:28:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-08 05:28:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-08 05:28:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-08 05:28:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:28:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:28:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-08 05:28:50,714 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-08 05:28:50,854 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:28:50,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:28:50,903 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3386: #res := ~retValue_acc~25; [2025-03-08 05:28:50,926 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3308: #res := ~retValue_acc~23; [2025-03-08 05:28:50,930 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: #res := ~retValue_acc~3; [2025-03-08 05:28:51,218 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1393: #res := ~retValue_acc~11; [2025-03-08 05:28:51,318 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1483-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~13#1; [2025-03-08 05:28:51,318 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L899-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~6#1; [2025-03-08 05:28:51,361 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1497: #res := ~retValue_acc~14; [2025-03-08 05:28:51,370 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3347: #res := ~retValue_acc~24; [2025-03-08 05:28:51,388 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L948: #res := ~retValue_acc~8; [2025-03-08 05:28:51,468 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L856-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~4#1; [2025-03-08 05:28:51,520 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1028-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~9#1; [2025-03-08 05:28:51,520 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041-1: isIdle_#res#1 := isIdle_~retValue_acc~10#1; [2025-03-08 05:28:51,572 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476: #res := ~retValue_acc~17; [2025-03-08 05:28:51,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142-1: main_#res#1 := main_~retValue_acc~20#1; [2025-03-08 05:28:51,622 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3268-1: valid_product_#res#1 := valid_product_~retValue_acc~22#1; [2025-03-08 05:28:51,630 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2240: #res := ~retValue_acc~16; [2025-03-08 05:28:51,631 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L865: #res := ~retValue_acc~5; [2025-03-08 05:28:51,635 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787: #res := ~retValue_acc~18; [2025-03-08 05:28:51,759 INFO L? ?]: Removed 434 outVars from TransFormulas that were not future-live. [2025-03-08 05:28:51,759 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:28:51,783 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:28:51,783 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:28:51,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:51 BoogieIcfgContainer [2025-03-08 05:28:51,783 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:28:51,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:28:51,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:28:51,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:28:51,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:28:49" (1/3) ... [2025-03-08 05:28:51,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3713666e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:51, skipping insertion in model container [2025-03-08 05:28:51,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:28:50" (2/3) ... [2025-03-08 05:28:51,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3713666e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:28:51, skipping insertion in model container [2025-03-08 05:28:51,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:28:51" (3/3) ... [2025-03-08 05:28:51,792 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product26.cil.c [2025-03-08 05:28:51,804 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:28:51,807 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product26.cil.c that has 24 procedures, 543 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:28:51,868 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:28:51,878 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;@d185c2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:28:51,879 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:28:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 543 states, 429 states have (on average 1.7086247086247086) internal successors, (733), 452 states have internal predecessors, (733), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) [2025-03-08 05:28:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 05:28:51,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:51,894 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] [2025-03-08 05:28:51,894 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1449037834, now seen corresponding path program 1 times [2025-03-08 05:28:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021133233] [2025-03-08 05:28:51,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:51,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 05:28:52,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 05:28:52,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:52,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:52,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:52,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021133233] [2025-03-08 05:28:52,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021133233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:52,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:52,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:52,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534382482] [2025-03-08 05:28:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:52,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:52,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:52,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:52,363 INFO L87 Difference]: Start difference. First operand has 543 states, 429 states have (on average 1.7086247086247086) internal successors, (733), 452 states have internal predecessors, (733), 89 states have call successors, (89), 23 states have call predecessors, (89), 23 states have return successors, (89), 82 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:52,490 INFO L93 Difference]: Finished difference Result 1066 states and 1797 transitions. [2025-03-08 05:28:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2025-03-08 05:28:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:52,507 INFO L225 Difference]: With dead ends: 1066 [2025-03-08 05:28:52,507 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:52,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:52,514 INFO L435 NwaCegarLoop]: 891 mSDtfsCounter, 5 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:52,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2669 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 423 states have (on average 1.706855791962175) internal successors, (722), 444 states have internal predecessors, (722), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 895 transitions. [2025-03-08 05:28:52,599 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 895 transitions. Word has length 58 [2025-03-08 05:28:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:52,600 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 895 transitions. [2025-03-08 05:28:52,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 895 transitions. [2025-03-08 05:28:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 05:28:52,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:52,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:52,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:28:52,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:52,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash -821921219, now seen corresponding path program 1 times [2025-03-08 05:28:52,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:52,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339130885] [2025-03-08 05:28:52,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:52,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:52,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-08 05:28:52,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 05:28:52,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:52,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:52,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:52,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:52,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339130885] [2025-03-08 05:28:52,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339130885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:52,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:52,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:52,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019072733] [2025-03-08 05:28:52,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:52,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:52,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:52,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:52,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:52,804 INFO L87 Difference]: Start difference. First operand 535 states and 895 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:52,880 INFO L93 Difference]: Finished difference Result 1052 states and 1767 transitions. [2025-03-08 05:28:52,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:52,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-08 05:28:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:52,887 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:52,888 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:52,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:52,891 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 4 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:52,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2648 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:52,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 423 states have (on average 1.7044917257683214) internal successors, (721), 444 states have internal predecessors, (721), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 894 transitions. [2025-03-08 05:28:52,920 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 894 transitions. Word has length 60 [2025-03-08 05:28:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:52,921 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 894 transitions. [2025-03-08 05:28:52,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:52,922 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 894 transitions. [2025-03-08 05:28:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 05:28:52,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:52,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:28:52,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2006934733, now seen corresponding path program 1 times [2025-03-08 05:28:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:52,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713859816] [2025-03-08 05:28:52,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:52,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:52,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 05:28:52,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 05:28:52,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:52,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:53,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:53,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:53,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713859816] [2025-03-08 05:28:53,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713859816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:53,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:53,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:53,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448373630] [2025-03-08 05:28:53,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:53,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:53,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:53,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:53,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,089 INFO L87 Difference]: Start difference. First operand 535 states and 894 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:53,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,157 INFO L93 Difference]: Finished difference Result 1052 states and 1766 transitions. [2025-03-08 05:28:53,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:53,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2025-03-08 05:28:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:53,164 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:53,164 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:53,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,169 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 3 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:53,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2648 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:53,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 423 states have (on average 1.702127659574468) internal successors, (720), 444 states have internal predecessors, (720), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 893 transitions. [2025-03-08 05:28:53,199 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 893 transitions. Word has length 61 [2025-03-08 05:28:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:53,200 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 893 transitions. [2025-03-08 05:28:53,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 893 transitions. [2025-03-08 05:28:53,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-08 05:28:53,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:53,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:53,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:28:53,202 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:53,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash -55870592, now seen corresponding path program 1 times [2025-03-08 05:28:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119885275] [2025-03-08 05:28:53,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:53,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 05:28:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 05:28:53,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:53,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:53,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:53,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:53,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119885275] [2025-03-08 05:28:53,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119885275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:53,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:53,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:53,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329933809] [2025-03-08 05:28:53,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:53,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:53,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:53,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:53,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,343 INFO L87 Difference]: Start difference. First operand 535 states and 893 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,392 INFO L93 Difference]: Finished difference Result 1052 states and 1765 transitions. [2025-03-08 05:28:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:53,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 62 [2025-03-08 05:28:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:53,398 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:53,398 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:53,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,402 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 2 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:53,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2648 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:53,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 423 states have (on average 1.6997635933806146) internal successors, (719), 444 states have internal predecessors, (719), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 892 transitions. [2025-03-08 05:28:53,432 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 892 transitions. Word has length 62 [2025-03-08 05:28:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:53,434 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 892 transitions. [2025-03-08 05:28:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 892 transitions. [2025-03-08 05:28:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 05:28:53,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:53,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:53,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:28:53,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:53,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:53,437 INFO L85 PathProgramCache]: Analyzing trace with hash 329353046, now seen corresponding path program 1 times [2025-03-08 05:28:53,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:53,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006576904] [2025-03-08 05:28:53,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:53,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:53,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 05:28:53,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 05:28:53,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:53,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:53,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006576904] [2025-03-08 05:28:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006576904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800485983] [2025-03-08 05:28:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:53,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:53,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:53,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,565 INFO L87 Difference]: Start difference. First operand 535 states and 892 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,600 INFO L93 Difference]: Finished difference Result 1052 states and 1764 transitions. [2025-03-08 05:28:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-08 05:28:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:53,604 INFO L225 Difference]: With dead ends: 1052 [2025-03-08 05:28:53,604 INFO L226 Difference]: Without dead ends: 535 [2025-03-08 05:28:53,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,607 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 1 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:53,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2648 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-03-08 05:28:53,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-03-08 05:28:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 423 states have (on average 1.6973995271867612) internal successors, (718), 444 states have internal predecessors, (718), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 891 transitions. [2025-03-08 05:28:53,647 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 891 transitions. Word has length 63 [2025-03-08 05:28:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 891 transitions. [2025-03-08 05:28:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 891 transitions. [2025-03-08 05:28:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:28:53,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:53,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:53,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:28:53,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:53,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -581838653, now seen corresponding path program 1 times [2025-03-08 05:28:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:53,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792000687] [2025-03-08 05:28:53,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:53,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:28:53,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:28:53,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:53,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:53,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:53,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792000687] [2025-03-08 05:28:53,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792000687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:53,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:53,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:53,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140696777] [2025-03-08 05:28:53,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:53,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:53,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:53,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:53,804 INFO L87 Difference]: Start difference. First operand 535 states and 891 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:28:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:53,882 INFO L93 Difference]: Finished difference Result 1018 states and 1696 transitions. [2025-03-08 05:28:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:53,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-03-08 05:28:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:53,888 INFO L225 Difference]: With dead ends: 1018 [2025-03-08 05:28:53,888 INFO L226 Difference]: Without dead ends: 550 [2025-03-08 05:28:53,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:53,891 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 91 mSDsluCounter, 4324 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:53,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5205 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:53,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-08 05:28:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 548. [2025-03-08 05:28:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 433 states have (on average 1.6928406466512702) internal successors, (733), 456 states have internal predecessors, (733), 90 states have call successors, (90), 23 states have call predecessors, (90), 24 states have return successors, (87), 82 states have call predecessors, (87), 85 states have call successors, (87) [2025-03-08 05:28:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 910 transitions. [2025-03-08 05:28:53,913 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 910 transitions. Word has length 64 [2025-03-08 05:28:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:53,914 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 910 transitions. [2025-03-08 05:28:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:28:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 910 transitions. [2025-03-08 05:28:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:28:53,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:53,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] [2025-03-08 05:28:53,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:28:53,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:53,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1389100804, now seen corresponding path program 1 times [2025-03-08 05:28:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660095877] [2025-03-08 05:28:53,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:53,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:28:53,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:28:53,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:53,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660095877] [2025-03-08 05:28:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660095877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510927697] [2025-03-08 05:28:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:53,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:53,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:53,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:53,996 INFO L87 Difference]: Start difference. First operand 548 states and 910 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:54,028 INFO L93 Difference]: Finished difference Result 1070 states and 1790 transitions. [2025-03-08 05:28:54,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:54,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-08 05:28:54,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,032 INFO L225 Difference]: With dead ends: 1070 [2025-03-08 05:28:54,032 INFO L226 Difference]: Without dead ends: 529 [2025-03-08 05:28:54,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:54,034 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 0 mSDsluCounter, 1765 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:54,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2650 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-08 05:28:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-03-08 05:28:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.6882494004796162) internal successors, (704), 438 states have internal predecessors, (704), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 877 transitions. [2025-03-08 05:28:54,051 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 877 transitions. Word has length 64 [2025-03-08 05:28:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:54,051 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 877 transitions. [2025-03-08 05:28:54,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,051 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 877 transitions. [2025-03-08 05:28:54,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:28:54,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:54,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:28:54,053 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash -384528995, now seen corresponding path program 1 times [2025-03-08 05:28:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716175970] [2025-03-08 05:28:54,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:28:54,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:28:54,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716175970] [2025-03-08 05:28:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716175970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:54,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467961995] [2025-03-08 05:28:54,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:54,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:54,165 INFO L87 Difference]: Start difference. First operand 529 states and 877 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:54,335 INFO L93 Difference]: Finished difference Result 1015 states and 1688 transitions. [2025-03-08 05:28:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:54,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-08 05:28:54,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,340 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:54,340 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:28:54,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:54,342 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 55 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4141 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:28:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 529. [2025-03-08 05:28:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.6786570743405276) internal successors, (700), 438 states have internal predecessors, (700), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 873 transitions. [2025-03-08 05:28:54,359 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 873 transitions. Word has length 65 [2025-03-08 05:28:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:54,359 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 873 transitions. [2025-03-08 05:28:54,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 873 transitions. [2025-03-08 05:28:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:28:54,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:54,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:28:54,362 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1861743244, now seen corresponding path program 1 times [2025-03-08 05:28:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479323356] [2025-03-08 05:28:54,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:28:54,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:28:54,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:54,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479323356] [2025-03-08 05:28:54,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479323356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:54,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373129798] [2025-03-08 05:28:54,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:54,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:54,454 INFO L87 Difference]: Start difference. First operand 529 states and 873 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:54,584 INFO L93 Difference]: Finished difference Result 1015 states and 1684 transitions. [2025-03-08 05:28:54,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:54,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-08 05:28:54,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,588 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:54,588 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:28:54,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:54,590 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 54 mSDsluCounter, 3307 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4141 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:54,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4141 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:54,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:28:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 529. [2025-03-08 05:28:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.669064748201439) internal successors, (696), 438 states have internal predecessors, (696), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 869 transitions. [2025-03-08 05:28:54,606 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 869 transitions. Word has length 66 [2025-03-08 05:28:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:54,606 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 869 transitions. [2025-03-08 05:28:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 869 transitions. [2025-03-08 05:28:54,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:28:54,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:54,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:28:54,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,608 INFO L85 PathProgramCache]: Analyzing trace with hash -480328102, now seen corresponding path program 1 times [2025-03-08 05:28:54,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624330041] [2025-03-08 05:28:54,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:28:54,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:28:54,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624330041] [2025-03-08 05:28:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624330041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917933888] [2025-03-08 05:28:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:54,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:54,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:54,695 INFO L87 Difference]: Start difference. First operand 529 states and 869 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:54,819 INFO L93 Difference]: Finished difference Result 1015 states and 1680 transitions. [2025-03-08 05:28:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-08 05:28:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,823 INFO L225 Difference]: With dead ends: 1015 [2025-03-08 05:28:54,823 INFO L226 Difference]: Without dead ends: 538 [2025-03-08 05:28:54,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:54,825 INFO L435 NwaCegarLoop]: 833 mSDtfsCounter, 53 mSDsluCounter, 3290 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4123 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:54,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4123 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:28:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-08 05:28:54,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 529. [2025-03-08 05:28:54,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 417 states have (on average 1.65947242206235) internal successors, (692), 438 states have internal predecessors, (692), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 865 transitions. [2025-03-08 05:28:54,839 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 865 transitions. Word has length 67 [2025-03-08 05:28:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:54,839 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 865 transitions. [2025-03-08 05:28:54,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 865 transitions. [2025-03-08 05:28:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:28:54,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:54,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:54,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:28:54,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:54,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -2090792885, now seen corresponding path program 1 times [2025-03-08 05:28:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136834365] [2025-03-08 05:28:54,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:54,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:28:54,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:28:54,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:54,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:54,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136834365] [2025-03-08 05:28:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136834365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:54,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:54,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:28:54,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591207376] [2025-03-08 05:28:54,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:54,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:28:54,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:54,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:28:54,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:54,942 INFO L87 Difference]: Start difference. First operand 529 states and 865 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:28:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:54,995 INFO L93 Difference]: Finished difference Result 1006 states and 1662 transitions. [2025-03-08 05:28:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:28:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-03-08 05:28:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:54,999 INFO L225 Difference]: With dead ends: 1006 [2025-03-08 05:28:54,999 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:55,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:28:55,001 INFO L435 NwaCegarLoop]: 854 mSDtfsCounter, 84 mSDsluCounter, 4197 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5051 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:55,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5051 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:55,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 396 states have (on average 1.6616161616161615) internal successors, (658), 417 states have internal predecessors, (658), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:55,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 831 transitions. [2025-03-08 05:28:55,015 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 831 transitions. Word has length 67 [2025-03-08 05:28:55,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,015 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 831 transitions. [2025-03-08 05:28:55,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-08 05:28:55,015 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 831 transitions. [2025-03-08 05:28:55,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:28:55,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:55,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:28:55,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,017 INFO L85 PathProgramCache]: Analyzing trace with hash 967837481, now seen corresponding path program 1 times [2025-03-08 05:28:55,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967737962] [2025-03-08 05:28:55,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:28:55,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:28:55,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967737962] [2025-03-08 05:28:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967737962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:55,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260711690] [2025-03-08 05:28:55,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:55,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:55,101 INFO L87 Difference]: Start difference. First operand 508 states and 831 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:55,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,160 INFO L93 Difference]: Finished difference Result 985 states and 1628 transitions. [2025-03-08 05:28:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-08 05:28:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,164 INFO L225 Difference]: With dead ends: 985 [2025-03-08 05:28:55,164 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:55,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:55,166 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 17 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4061 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:55,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4061 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:55,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 396 states have (on average 1.6590909090909092) internal successors, (657), 417 states have internal predecessors, (657), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 830 transitions. [2025-03-08 05:28:55,181 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 830 transitions. Word has length 68 [2025-03-08 05:28:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,181 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 830 transitions. [2025-03-08 05:28:55,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 830 transitions. [2025-03-08 05:28:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-08 05:28:55,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:55,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:28:55,183 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash -345736425, now seen corresponding path program 1 times [2025-03-08 05:28:55,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497476501] [2025-03-08 05:28:55,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-08 05:28:55,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-08 05:28:55,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497476501] [2025-03-08 05:28:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497476501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:28:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207867799] [2025-03-08 05:28:55,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:28:55,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:28:55,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:28:55,268 INFO L87 Difference]: Start difference. First operand 508 states and 830 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,330 INFO L93 Difference]: Finished difference Result 985 states and 1627 transitions. [2025-03-08 05:28:55,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:28:55,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-08 05:28:55,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,334 INFO L225 Difference]: With dead ends: 985 [2025-03-08 05:28:55,334 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:55,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:28:55,336 INFO L435 NwaCegarLoop]: 814 mSDtfsCounter, 16 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4061 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:55,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4061 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 396 states have (on average 1.6565656565656566) internal successors, (656), 417 states have internal predecessors, (656), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 829 transitions. [2025-03-08 05:28:55,374 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 829 transitions. Word has length 69 [2025-03-08 05:28:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,375 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 829 transitions. [2025-03-08 05:28:55,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 829 transitions. [2025-03-08 05:28:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-08 05:28:55,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:28:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:28:55,376 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1373888570, now seen corresponding path program 1 times [2025-03-08 05:28:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258955907] [2025-03-08 05:28:55,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-08 05:28:55,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 05:28:55,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258955907] [2025-03-08 05:28:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258955907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:28:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176313280] [2025-03-08 05:28:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:28:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:28:55,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:55,455 INFO L87 Difference]: Start difference. First operand 508 states and 829 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:55,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:55,493 INFO L93 Difference]: Finished difference Result 979 states and 1615 transitions. [2025-03-08 05:28:55,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:28:55,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-08 05:28:55,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:55,497 INFO L225 Difference]: With dead ends: 979 [2025-03-08 05:28:55,497 INFO L226 Difference]: Without dead ends: 508 [2025-03-08 05:28:55,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:28:55,500 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 5 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:55,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2441 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:28:55,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-08 05:28:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-08 05:28:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 396 states have (on average 1.654040404040404) internal successors, (655), 417 states have internal predecessors, (655), 89 states have call successors, (89), 23 states have call predecessors, (89), 22 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 05:28:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 828 transitions. [2025-03-08 05:28:55,517 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 828 transitions. Word has length 70 [2025-03-08 05:28:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:55,518 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 828 transitions. [2025-03-08 05:28:55,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 05:28:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 828 transitions. [2025-03-08 05:28:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 05:28:55,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:55,519 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] [2025-03-08 05:28:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:28:55,519 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:55,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash 347030948, now seen corresponding path program 1 times [2025-03-08 05:28:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646074795] [2025-03-08 05:28:55,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:55,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:55,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 05:28:55,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 05:28:55,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:55,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646074795] [2025-03-08 05:28:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646074795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:28:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602477922] [2025-03-08 05:28:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:55,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:28:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:55,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:28:55,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:55,698 INFO L87 Difference]: Start difference. First operand 508 states and 828 transitions. Second operand has 12 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:28:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:28:59,740 INFO L93 Difference]: Finished difference Result 1647 states and 2788 transitions. [2025-03-08 05:28:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:28:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 71 [2025-03-08 05:28:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:28:59,749 INFO L225 Difference]: With dead ends: 1647 [2025-03-08 05:28:59,749 INFO L226 Difference]: Without dead ends: 1184 [2025-03-08 05:28:59,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:28:59,753 INFO L435 NwaCegarLoop]: 838 mSDtfsCounter, 3280 mSDsluCounter, 5674 mSDsCounter, 0 mSdLazyCounter, 9222 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3317 SdHoareTripleChecker+Valid, 6512 SdHoareTripleChecker+Invalid, 10178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 9222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:28:59,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3317 Valid, 6512 Invalid, 10178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 9222 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 05:28:59,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-03-08 05:28:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1137. [2025-03-08 05:28:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 850 states have (on average 1.6529411764705881) internal successors, (1405), 904 states have internal predecessors, (1405), 240 states have call successors, (240), 41 states have call predecessors, (240), 46 states have return successors, (260), 234 states have call predecessors, (260), 235 states have call successors, (260) [2025-03-08 05:28:59,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1905 transitions. [2025-03-08 05:28:59,801 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1905 transitions. Word has length 71 [2025-03-08 05:28:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:28:59,801 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1905 transitions. [2025-03-08 05:28:59,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:28:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1905 transitions. [2025-03-08 05:28:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 05:28:59,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:28:59,803 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] [2025-03-08 05:28:59,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:28:59,803 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:28:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:28:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1343926727, now seen corresponding path program 1 times [2025-03-08 05:28:59,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:28:59,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838709335] [2025-03-08 05:28:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:28:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:28:59,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 05:28:59,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 05:28:59,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:28:59,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:28:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:28:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:28:59,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838709335] [2025-03-08 05:28:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838709335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:28:59,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:28:59,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:28:59,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787138167] [2025-03-08 05:28:59,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:28:59,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:28:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:28:59,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:28:59,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:28:59,984 INFO L87 Difference]: Start difference. First operand 1137 states and 1905 transitions. Second operand has 12 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:03,460 INFO L93 Difference]: Finished difference Result 4043 states and 7012 transitions. [2025-03-08 05:29:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:03,461 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 72 [2025-03-08 05:29:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:03,479 INFO L225 Difference]: With dead ends: 4043 [2025-03-08 05:29:03,480 INFO L226 Difference]: Without dead ends: 2951 [2025-03-08 05:29:03,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:29:03,490 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3278 mSDsluCounter, 5629 mSDsCounter, 0 mSdLazyCounter, 9226 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3315 SdHoareTripleChecker+Valid, 6460 SdHoareTripleChecker+Invalid, 10175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 9226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:03,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3315 Valid, 6460 Invalid, 10175 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [949 Valid, 9226 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 05:29:03,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2025-03-08 05:29:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2874. [2025-03-08 05:29:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2874 states, 2037 states have (on average 1.6332842415316642) internal successors, (3327), 2195 states have internal predecessors, (3327), 728 states have call successors, (728), 77 states have call predecessors, (728), 108 states have return successors, (885), 739 states have call predecessors, (885), 723 states have call successors, (885) [2025-03-08 05:29:03,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2874 states to 2874 states and 4940 transitions. [2025-03-08 05:29:03,616 INFO L78 Accepts]: Start accepts. Automaton has 2874 states and 4940 transitions. Word has length 72 [2025-03-08 05:29:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:03,616 INFO L471 AbstractCegarLoop]: Abstraction has 2874 states and 4940 transitions. [2025-03-08 05:29:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2874 states and 4940 transitions. [2025-03-08 05:29:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 05:29:03,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:03,617 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] [2025-03-08 05:29:03,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:29:03,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:03,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1123447303, now seen corresponding path program 1 times [2025-03-08 05:29:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:03,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223237551] [2025-03-08 05:29:03,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:03,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:03,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 05:29:03,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 05:29:03,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:03,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:03,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223237551] [2025-03-08 05:29:03,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223237551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:03,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086887021] [2025-03-08 05:29:03,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:03,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:03,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:03,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:03,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:03,817 INFO L87 Difference]: Start difference. First operand 2874 states and 4940 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:07,014 INFO L93 Difference]: Finished difference Result 11098 states and 19740 transitions. [2025-03-08 05:29:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:07,015 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 73 [2025-03-08 05:29:07,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:07,065 INFO L225 Difference]: With dead ends: 11098 [2025-03-08 05:29:07,065 INFO L226 Difference]: Without dead ends: 8269 [2025-03-08 05:29:07,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:29:07,088 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3284 mSDsluCounter, 5629 mSDsCounter, 0 mSdLazyCounter, 9242 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3321 SdHoareTripleChecker+Valid, 6460 SdHoareTripleChecker+Invalid, 10191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 9242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:07,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3321 Valid, 6460 Invalid, 10191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 9242 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 05:29:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8269 states. [2025-03-08 05:29:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8269 to 8132. [2025-03-08 05:29:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8132 states, 5455 states have (on average 1.6053162236480294) internal successors, (8757), 5953 states have internal predecessors, (8757), 2392 states have call successors, (2392), 149 states have call predecessors, (2392), 284 states have return successors, (3207), 2489 states have call predecessors, (3207), 2387 states have call successors, (3207) [2025-03-08 05:29:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 14356 transitions. [2025-03-08 05:29:07,605 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 14356 transitions. Word has length 73 [2025-03-08 05:29:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 8132 states and 14356 transitions. [2025-03-08 05:29:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 14356 transitions. [2025-03-08 05:29:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 05:29:07,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:07,607 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:29:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:07,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:07,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash -644881988, now seen corresponding path program 1 times [2025-03-08 05:29:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:07,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046489519] [2025-03-08 05:29:07,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:07,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 05:29:07,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 05:29:07,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046489519] [2025-03-08 05:29:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046489519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:07,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949724677] [2025-03-08 05:29:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:07,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:07,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:07,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:07,793 INFO L87 Difference]: Start difference. First operand 8132 states and 14356 transitions. Second operand has 12 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:11,571 INFO L93 Difference]: Finished difference Result 33741 states and 61627 transitions. [2025-03-08 05:29:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 74 [2025-03-08 05:29:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:11,735 INFO L225 Difference]: With dead ends: 33741 [2025-03-08 05:29:11,735 INFO L226 Difference]: Without dead ends: 25654 [2025-03-08 05:29:11,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:29:11,787 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 4063 mSDsluCounter, 5349 mSDsCounter, 0 mSdLazyCounter, 8627 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4100 SdHoareTripleChecker+Valid, 6180 SdHoareTripleChecker+Invalid, 9856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 8627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:11,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4100 Valid, 6180 Invalid, 9856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1229 Valid, 8627 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 05:29:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25654 states. [2025-03-08 05:29:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25654 to 25397. [2025-03-08 05:29:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25397 states, 16270 states have (on average 1.5787953288260603) internal successors, (25687), 17919 states have internal predecessors, (25687), 8290 states have call successors, (8290), 293 states have call predecessors, (8290), 836 states have return successors, (12086), 8766 states have call predecessors, (12086), 8285 states have call successors, (12086) [2025-03-08 05:29:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25397 states to 25397 states and 46063 transitions. [2025-03-08 05:29:13,597 INFO L78 Accepts]: Start accepts. Automaton has 25397 states and 46063 transitions. Word has length 74 [2025-03-08 05:29:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:13,598 INFO L471 AbstractCegarLoop]: Abstraction has 25397 states and 46063 transitions. [2025-03-08 05:29:13,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 25397 states and 46063 transitions. [2025-03-08 05:29:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 05:29:13,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:13,600 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] [2025-03-08 05:29:13,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:29:13,600 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:13,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:13,601 INFO L85 PathProgramCache]: Analyzing trace with hash -576028054, now seen corresponding path program 1 times [2025-03-08 05:29:13,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:13,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648627541] [2025-03-08 05:29:13,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:13,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:13,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 05:29:13,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 05:29:13,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:13,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648627541] [2025-03-08 05:29:13,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648627541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:13,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:13,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:13,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719398954] [2025-03-08 05:29:13,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:13,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:13,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:13,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:13,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:13,766 INFO L87 Difference]: Start difference. First operand 25397 states and 46063 transitions. Second operand has 12 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:20,822 INFO L93 Difference]: Finished difference Result 111550 states and 209046 transitions. [2025-03-08 05:29:20,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 05:29:20,823 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2025-03-08 05:29:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:21,734 INFO L225 Difference]: With dead ends: 111550 [2025-03-08 05:29:21,734 INFO L226 Difference]: Without dead ends: 86198 [2025-03-08 05:29:21,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-08 05:29:21,912 INFO L435 NwaCegarLoop]: 831 mSDtfsCounter, 3296 mSDsluCounter, 5629 mSDsCounter, 0 mSdLazyCounter, 9274 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3333 SdHoareTripleChecker+Valid, 6460 SdHoareTripleChecker+Invalid, 10223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 9274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:21,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3333 Valid, 6460 Invalid, 10223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 9274 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 05:29:21,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86198 states. [2025-03-08 05:29:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86198 to 85701. [2025-03-08 05:29:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85701 states, 53234 states have (on average 1.559773828756058) internal successors, (83033), 58897 states have internal predecessors, (83033), 29742 states have call successors, (29742), 581 states have call predecessors, (29742), 2724 states have return successors, (46624), 31798 states have call predecessors, (46624), 29737 states have call successors, (46624) [2025-03-08 05:29:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85701 states to 85701 states and 159399 transitions. [2025-03-08 05:29:27,882 INFO L78 Accepts]: Start accepts. Automaton has 85701 states and 159399 transitions. Word has length 75 [2025-03-08 05:29:27,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:27,883 INFO L471 AbstractCegarLoop]: Abstraction has 85701 states and 159399 transitions. [2025-03-08 05:29:27,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-08 05:29:27,883 INFO L276 IsEmpty]: Start isEmpty. Operand 85701 states and 159399 transitions. [2025-03-08 05:29:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 05:29:27,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:27,885 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:29:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:29:27,885 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:27,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash 610931007, now seen corresponding path program 1 times [2025-03-08 05:29:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200607294] [2025-03-08 05:29:27,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:27,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 05:29:27,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 05:29:27,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:27,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:29:28,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:28,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200607294] [2025-03-08 05:29:28,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200607294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:28,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:28,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 05:29:28,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167792641] [2025-03-08 05:29:28,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:28,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:29:28,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:28,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:29:28,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:29:28,057 INFO L87 Difference]: Start difference. First operand 85701 states and 159399 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7)