./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product22.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 10f09c8c5639b403d441157c6cb90f176690981c36f4af5417d0103735cbe364 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:17:47,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:17:47,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:17:47,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:17:47,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:17:47,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:17:47,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:17:47,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:17:47,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:17:47,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:17:47,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:17:47,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:17:47,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:17:47,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:17:47,662 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:17:47,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:17:47,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:17:47,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:17:47,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:17:47,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:17:47,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:17:47,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:47,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:17:47,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:17:47,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:17:47,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:17:47,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:17:47,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:17:47,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:17:47,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:17:47,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:17:47,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:17:47,665 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 -> 10f09c8c5639b403d441157c6cb90f176690981c36f4af5417d0103735cbe364 [2025-03-03 14:17:47,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:17:47,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:17:47,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:17:47,946 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:17:47,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:17:47,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c [2025-03-03 14:17:49,145 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd5914aa/ad425c572ea54cdfa2bf6ad365826aca/FLAG7027a07ac [2025-03-03 14:17:49,510 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:17:49,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product22.cil.c [2025-03-03 14:17:49,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd5914aa/ad425c572ea54cdfa2bf6ad365826aca/FLAG7027a07ac [2025-03-03 14:17:49,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cd5914aa/ad425c572ea54cdfa2bf6ad365826aca [2025-03-03 14:17:49,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:17:49,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:17:49,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:49,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:17:49,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:17:49,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:49" (1/1) ... [2025-03-03 14:17:49,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eebfa97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:49, skipping insertion in model container [2025-03-03 14:17:49,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:17:49" (1/1) ... [2025-03-03 14:17:49,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:17:49,775 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_spec3_product22.cil.c[3205,3218] [2025-03-03 14:17:50,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:50,049 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:17:50,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-03 14:17:50,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [150] [2025-03-03 14:17:50,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [159] [2025-03-03 14:17:50,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [525] [2025-03-03 14:17:50,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [563] [2025-03-03 14:17:50,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [752] [2025-03-03 14:17:50,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1102] [2025-03-03 14:17:50,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1769] [2025-03-03 14:17:50,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1784] [2025-03-03 14:17:50,057 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1904] [2025-03-03 14:17:50,063 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_spec3_product22.cil.c[3205,3218] [2025-03-03 14:17:50,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:17:50,172 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:17:50,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50 WrapperNode [2025-03-03 14:17:50,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:17:50,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:50,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:17:50,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:17:50,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,230 INFO L138 Inliner]: procedures = 92, calls = 351, calls flagged for inlining = 26, calls inlined = 22, statements flattened = 901 [2025-03-03 14:17:50,230 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:17:50,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:17:50,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:17:50,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:17:50,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,248 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,269 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-03 14:17:50,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:17:50,301 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:17:50,301 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:17:50,301 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:17:50,302 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (1/1) ... [2025-03-03 14:17:50,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:17:50,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:50,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:17:50,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:17:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:17:50,349 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-03 14:17:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-03 14:17:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:17:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:17:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:17:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:17:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:17:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:17:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-03 14:17:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-03 14:17:50,350 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:17:50,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:17:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:17:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:17:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:17:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:17:50,351 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:17:50,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:17:50,352 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:17:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:17:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:17:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:17:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:17:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:17:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:17:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:17:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:17:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:17:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:17:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:17:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:17:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:17:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:17:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2025-03-03 14:17:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:17:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:17:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:17:50,356 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:17:50,516 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:17:50,519 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:17:50,548 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2181: #res := ~retValue_acc~17; [2025-03-03 14:17:50,575 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1823: #res := ~retValue_acc~10; [2025-03-03 14:17:50,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: #res#1 := ~retValue_acc~22#1; [2025-03-03 14:17:50,652 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2739-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~23#1; [2025-03-03 14:17:50,663 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2837: #res := ~retValue_acc~26; [2025-03-03 14:17:50,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2301-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~19#1; [2025-03-03 14:17:50,743 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2314-1: isIdle_#res#1 := isIdle_~retValue_acc~20#1; [2025-03-03 14:17:50,827 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2138-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~15#1; [2025-03-03 14:17:50,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1766: #res := ~retValue_acc~9; [2025-03-03 14:17:50,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1901: #res := ~retValue_acc~12; [2025-03-03 14:17:50,847 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: #res := ~retValue_acc~13; [2025-03-03 14:17:50,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2129: #res := ~retValue_acc~14; [2025-03-03 14:17:50,980 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1862: #res := ~retValue_acc~11; [2025-03-03 14:17:50,998 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2172: #res := ~retValue_acc~16; [2025-03-03 14:17:51,072 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1455: #res := ~retValue_acc~8; [2025-03-03 14:17:51,183 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795-1: stopRequestedAtCurrentFloor__wrappee__weight_#res#1 := stopRequestedAtCurrentFloor__wrappee__weight_~retValue_acc~24#1; [2025-03-03 14:17:51,184 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2823-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~25#1; [2025-03-03 14:17:51,287 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2666: #res := ~retValue_acc~21; [2025-03-03 14:17:51,332 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L560-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2025-03-03 14:17:51,332 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1099-1: main_#res#1 := main_~retValue_acc~6#1; [2025-03-03 14:17:51,340 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1219: #res := ~retValue_acc~7; [2025-03-03 14:17:51,456 INFO L? ?]: Removed 462 outVars from TransFormulas that were not future-live. [2025-03-03 14:17:51,456 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:17:51,483 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:17:51,484 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:17:51,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:51 BoogieIcfgContainer [2025-03-03 14:17:51,484 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:17:51,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:17:51,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:17:51,489 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:17:51,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:17:49" (1/3) ... [2025-03-03 14:17:51,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d5cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:51, skipping insertion in model container [2025-03-03 14:17:51,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:17:50" (2/3) ... [2025-03-03 14:17:51,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d5cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:17:51, skipping insertion in model container [2025-03-03 14:17:51,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:17:51" (3/3) ... [2025-03-03 14:17:51,490 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product22.cil.c [2025-03-03 14:17:51,500 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:17:51,504 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product22.cil.c that has 28 procedures, 595 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:17:51,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:17:51,566 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;@1f40ead2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:17:51,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:17:51,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 595 states, 458 states have (on average 1.6724890829694323) internal successors, (766), 478 states have internal predecessors, (766), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-03 14:17:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:17:51,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:51,579 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:51,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:51,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:51,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1181978536, now seen corresponding path program 1 times [2025-03-03 14:17:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518339075] [2025-03-03 14:17:51,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:51,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:17:51,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:17:51,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:51,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518339075] [2025-03-03 14:17:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518339075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:52,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:52,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:52,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506526801] [2025-03-03 14:17:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:52,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:52,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:52,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:52,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:52,197 INFO L87 Difference]: Start difference. First operand has 595 states, 458 states have (on average 1.6724890829694323) internal successors, (766), 478 states have internal predecessors, (766), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 104 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:52,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:52,402 INFO L93 Difference]: Finished difference Result 1187 states and 1976 transitions. [2025-03-03 14:17:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:52,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2025-03-03 14:17:52,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:52,423 INFO L225 Difference]: With dead ends: 1187 [2025-03-03 14:17:52,423 INFO L226 Difference]: Without dead ends: 600 [2025-03-03 14:17:52,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:52,438 INFO L435 NwaCegarLoop]: 967 mSDtfsCounter, 91 mSDsluCounter, 4749 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5716 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:52,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5716 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-03 14:17:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2025-03-03 14:17:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 461 states have (on average 1.665943600867679) internal successors, (768), 481 states have internal predecessors, (768), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 103 states have call predecessors, (108), 106 states have call successors, (108) [2025-03-03 14:17:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 985 transitions. [2025-03-03 14:17:52,516 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 985 transitions. Word has length 67 [2025-03-03 14:17:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 985 transitions. [2025-03-03 14:17:52,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 985 transitions. [2025-03-03 14:17:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:17:52,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:52,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:52,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:17:52,524 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:52,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:52,524 INFO L85 PathProgramCache]: Analyzing trace with hash -400523448, now seen corresponding path program 1 times [2025-03-03 14:17:52,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:52,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57960446] [2025-03-03 14:17:52,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:52,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:52,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:17:52,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:17:52,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:52,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:52,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57960446] [2025-03-03 14:17:52,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57960446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:52,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:52,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:52,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064802010] [2025-03-03 14:17:52,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:52,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:52,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:52,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:52,687 INFO L87 Difference]: Start difference. First operand 598 states and 985 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:52,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:52,746 INFO L93 Difference]: Finished difference Result 1178 states and 1951 transitions. [2025-03-03 14:17:52,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:52,747 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2025-03-03 14:17:52,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:52,753 INFO L225 Difference]: With dead ends: 1178 [2025-03-03 14:17:52,753 INFO L226 Difference]: Without dead ends: 574 [2025-03-03 14:17:52,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:17:52,757 INFO L435 NwaCegarLoop]: 955 mSDtfsCounter, 14 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:52,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2860 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-03-03 14:17:52,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2025-03-03 14:17:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 440 states have (on average 1.6568181818181817) internal successors, (729), 458 states have internal predecessors, (729), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 942 transitions. [2025-03-03 14:17:52,785 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 942 transitions. Word has length 68 [2025-03-03 14:17:52,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:52,786 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 942 transitions. [2025-03-03 14:17:52,786 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:52,786 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 942 transitions. [2025-03-03 14:17:52,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:17:52,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:52,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:52,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:17:52,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:52,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:52,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1088897233, now seen corresponding path program 1 times [2025-03-03 14:17:52,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:52,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394198717] [2025-03-03 14:17:52,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:52,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:52,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:17:52,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:17:52,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:52,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:53,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394198717] [2025-03-03 14:17:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394198717] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:53,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873811957] [2025-03-03 14:17:53,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:53,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:53,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:53,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:53,037 INFO L87 Difference]: Start difference. First operand 574 states and 942 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:53,116 INFO L93 Difference]: Finished difference Result 1141 states and 1883 transitions. [2025-03-03 14:17:53,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:53,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 68 [2025-03-03 14:17:53,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:53,121 INFO L225 Difference]: With dead ends: 1141 [2025-03-03 14:17:53,121 INFO L226 Difference]: Without dead ends: 568 [2025-03-03 14:17:53,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:53,125 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 77 mSDsluCounter, 4585 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5516 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:53,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5516 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-03 14:17:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2025-03-03 14:17:53,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 434 states have (on average 1.6497695852534562) internal successors, (716), 452 states have internal predecessors, (716), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:53,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 929 transitions. [2025-03-03 14:17:53,151 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 929 transitions. Word has length 68 [2025-03-03 14:17:53,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:53,152 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 929 transitions. [2025-03-03 14:17:53,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,152 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 929 transitions. [2025-03-03 14:17:53,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:17:53,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:53,153 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:53,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:17:53,153 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:53,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:53,156 INFO L85 PathProgramCache]: Analyzing trace with hash -723543086, now seen corresponding path program 1 times [2025-03-03 14:17:53,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:53,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543984197] [2025-03-03 14:17:53,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:53,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:17:53,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:17:53,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:53,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543984197] [2025-03-03 14:17:53,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543984197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:53,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:53,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502405473] [2025-03-03 14:17:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:53,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:53,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:53,304 INFO L87 Difference]: Start difference. First operand 568 states and 929 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, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:53,367 INFO L93 Difference]: Finished difference Result 1129 states and 1857 transitions. [2025-03-03 14:17:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:53,367 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, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 69 [2025-03-03 14:17:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:53,372 INFO L225 Difference]: With dead ends: 1129 [2025-03-03 14:17:53,373 INFO L226 Difference]: Without dead ends: 562 [2025-03-03 14:17:53,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:53,376 INFO L435 NwaCegarLoop]: 919 mSDtfsCounter, 63 mSDsluCounter, 4537 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5456 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:53,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5456 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-03 14:17:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2025-03-03 14:17:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 428 states have (on average 1.6425233644859814) internal successors, (703), 446 states have internal predecessors, (703), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 916 transitions. [2025-03-03 14:17:53,428 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 916 transitions. Word has length 69 [2025-03-03 14:17:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:53,428 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 916 transitions. [2025-03-03 14:17:53,429 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, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 916 transitions. [2025-03-03 14:17:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:17:53,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:53,429 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:53,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:17:53,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:53,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash -269763253, now seen corresponding path program 1 times [2025-03-03 14:17:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:53,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249610200] [2025-03-03 14:17:53,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:17:53,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:17:53,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249610200] [2025-03-03 14:17:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249610200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:53,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52566316] [2025-03-03 14:17:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:53,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:53,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:53,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:53,571 INFO L87 Difference]: Start difference. First operand 562 states and 916 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:53,625 INFO L93 Difference]: Finished difference Result 1117 states and 1831 transitions. [2025-03-03 14:17:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:53,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-03 14:17:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:53,629 INFO L225 Difference]: With dead ends: 1117 [2025-03-03 14:17:53,629 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:17:53,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:53,632 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 49 mSDsluCounter, 4489 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5396 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:53,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5396 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:17:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:17:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 422 states have (on average 1.6350710900473933) internal successors, (690), 440 states have internal predecessors, (690), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 903 transitions. [2025-03-03 14:17:53,650 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 903 transitions. Word has length 70 [2025-03-03 14:17:53,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:53,650 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 903 transitions. [2025-03-03 14:17:53,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,651 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 903 transitions. [2025-03-03 14:17:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:17:53,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:53,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:53,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:17:53,652 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:53,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:53,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1292556925, now seen corresponding path program 1 times [2025-03-03 14:17:53,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:53,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519408842] [2025-03-03 14:17:53,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:53,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:17:53,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:17:53,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:53,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:53,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519408842] [2025-03-03 14:17:53,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519408842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:53,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:53,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:53,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967139792] [2025-03-03 14:17:53,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:53,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:53,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:53,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:53,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:53,824 INFO L87 Difference]: Start difference. First operand 556 states and 903 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:53,893 INFO L93 Difference]: Finished difference Result 1105 states and 1805 transitions. [2025-03-03 14:17:53,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:53,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2025-03-03 14:17:53,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:53,898 INFO L225 Difference]: With dead ends: 1105 [2025-03-03 14:17:53,898 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:17:53,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:17:53,902 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 24 mSDsluCounter, 4453 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5348 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:53,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5348 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:53,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:17:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:17:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 422 states have (on average 1.632701421800948) internal successors, (689), 440 states have internal predecessors, (689), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 902 transitions. [2025-03-03 14:17:53,926 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 902 transitions. Word has length 70 [2025-03-03 14:17:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 902 transitions. [2025-03-03 14:17:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 902 transitions. [2025-03-03 14:17:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:17:53,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:53,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:17:53,929 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:53,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:53,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1717364556, now seen corresponding path program 1 times [2025-03-03 14:17:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:53,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871256579] [2025-03-03 14:17:53,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:53,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:17:53,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:17:53,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:53,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:54,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:54,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871256579] [2025-03-03 14:17:54,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871256579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:54,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421392758] [2025-03-03 14:17:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:54,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:54,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:54,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:54,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,004 INFO L87 Difference]: Start difference. First operand 556 states and 902 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:54,043 INFO L93 Difference]: Finished difference Result 1096 states and 1790 transitions. [2025-03-03 14:17:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:54,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-03 14:17:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:54,047 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:17:54,048 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:17:54,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,050 INFO L435 NwaCegarLoop]: 887 mSDtfsCounter, 15 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:54,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2646 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:54,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:17:54,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:17:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 422 states have (on average 1.6303317535545023) internal successors, (688), 440 states have internal predecessors, (688), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:54,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 901 transitions. [2025-03-03 14:17:54,066 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 901 transitions. Word has length 71 [2025-03-03 14:17:54,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:54,067 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 901 transitions. [2025-03-03 14:17:54,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 901 transitions. [2025-03-03 14:17:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:17:54,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:54,068 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:54,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:17:54,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:54,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1366466829, now seen corresponding path program 1 times [2025-03-03 14:17:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:54,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705043979] [2025-03-03 14:17:54,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:54,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:17:54,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:17:54,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:54,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:54,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705043979] [2025-03-03 14:17:54,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705043979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:54,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:54,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:54,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448071137] [2025-03-03 14:17:54,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:54,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:54,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:54,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:54,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,153 INFO L87 Difference]: Start difference. First operand 556 states and 901 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:54,189 INFO L93 Difference]: Finished difference Result 1096 states and 1788 transitions. [2025-03-03 14:17:54,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-03 14:17:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:54,194 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:17:54,194 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:17:54,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,198 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 14 mSDsluCounter, 1760 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:54,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2648 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:17:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:17:54,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 422 states have (on average 1.627962085308057) internal successors, (687), 440 states have internal predecessors, (687), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:54,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 900 transitions. [2025-03-03 14:17:54,216 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 900 transitions. Word has length 72 [2025-03-03 14:17:54,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:54,217 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 900 transitions. [2025-03-03 14:17:54,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,217 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 900 transitions. [2025-03-03 14:17:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:17:54,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:54,219 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:54,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:17:54,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:54,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2026835537, now seen corresponding path program 1 times [2025-03-03 14:17:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085033933] [2025-03-03 14:17:54,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:54,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:17:54,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:17:54,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:54,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:54,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085033933] [2025-03-03 14:17:54,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085033933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:54,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:54,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:54,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132272866] [2025-03-03 14:17:54,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:54,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:54,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:54,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:54,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,291 INFO L87 Difference]: Start difference. First operand 556 states and 900 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:54,332 INFO L93 Difference]: Finished difference Result 1096 states and 1786 transitions. [2025-03-03 14:17:54,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:54,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-03 14:17:54,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:54,337 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:17:54,338 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:17:54,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,342 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 13 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2650 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:54,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2650 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:54,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:17:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:17:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 422 states have (on average 1.6255924170616114) internal successors, (686), 440 states have internal predecessors, (686), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 899 transitions. [2025-03-03 14:17:54,359 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 899 transitions. Word has length 73 [2025-03-03 14:17:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:54,360 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 899 transitions. [2025-03-03 14:17:54,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 899 transitions. [2025-03-03 14:17:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:17:54,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:54,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:54,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:17:54,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:54,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash -574305290, now seen corresponding path program 1 times [2025-03-03 14:17:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:54,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428234649] [2025-03-03 14:17:54,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:54,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:17:54,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:17:54,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:54,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:54,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428234649] [2025-03-03 14:17:54,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428234649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:54,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:54,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:54,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529196245] [2025-03-03 14:17:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:54,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:54,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,446 INFO L87 Difference]: Start difference. First operand 556 states and 899 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:54,479 INFO L93 Difference]: Finished difference Result 1096 states and 1784 transitions. [2025-03-03 14:17:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:17:54,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-03 14:17:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:54,486 INFO L225 Difference]: With dead ends: 1096 [2025-03-03 14:17:54,486 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:17:54,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:54,489 INFO L435 NwaCegarLoop]: 890 mSDtfsCounter, 12 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:54,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2652 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:54,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:17:54,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-03 14:17:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 422 states have (on average 1.6232227488151658) internal successors, (685), 440 states have internal predecessors, (685), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 102 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-03 14:17:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 898 transitions. [2025-03-03 14:17:54,507 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 898 transitions. Word has length 74 [2025-03-03 14:17:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:54,507 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 898 transitions. [2025-03-03 14:17:54,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-03 14:17:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 898 transitions. [2025-03-03 14:17:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 14:17:54,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:54,508 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:54,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:17:54,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:54,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1953583122, now seen corresponding path program 1 times [2025-03-03 14:17:54,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:54,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122557712] [2025-03-03 14:17:54,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:54,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:17:54,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:17:54,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122557712] [2025-03-03 14:17:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122557712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902956446] [2025-03-03 14:17:54,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:54,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:54,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:54,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:54,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:17:54,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 14:17:54,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 14:17:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:54,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:54,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:54,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902956446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:54,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:54,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:54,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860200135] [2025-03-03 14:17:54,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:54,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:54,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:54,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:54,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:54,975 INFO L87 Difference]: Start difference. First operand 556 states and 898 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:55,029 INFO L93 Difference]: Finished difference Result 1579 states and 2582 transitions. [2025-03-03 14:17:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-03 14:17:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:55,037 INFO L225 Difference]: With dead ends: 1579 [2025-03-03 14:17:55,037 INFO L226 Difference]: Without dead ends: 1041 [2025-03-03 14:17:55,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:55,040 INFO L435 NwaCegarLoop]: 907 mSDtfsCounter, 860 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:55,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1699 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2025-03-03 14:17:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1026. [2025-03-03 14:17:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 786 states have (on average 1.6361323155216285) internal successors, (1286), 821 states have internal predecessors, (1286), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 183 states have call predecessors, (193), 188 states have call successors, (193) [2025-03-03 14:17:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1670 transitions. [2025-03-03 14:17:55,078 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1670 transitions. Word has length 75 [2025-03-03 14:17:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1670 transitions. [2025-03-03 14:17:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1670 transitions. [2025-03-03 14:17:55,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:17:55,081 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:55,081 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:55,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:17:55,282 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:55,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2023712023, now seen corresponding path program 1 times [2025-03-03 14:17:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:55,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521561440] [2025-03-03 14:17:55,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:55,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:17:55,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:17:55,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:55,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:55,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521561440] [2025-03-03 14:17:55,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521561440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458488086] [2025-03-03 14:17:55,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:55,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:55,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:55,452 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:55,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:17:55,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:17:55,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:17:55,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:55,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:55,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 1494 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:17:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:55,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458488086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-03 14:17:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636078704] [2025-03-03 14:17:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:55,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:17:55,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:55,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:17:55,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:55,785 INFO L87 Difference]: Start difference. First operand 1026 states and 1670 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:55,863 INFO L93 Difference]: Finished difference Result 2519 states and 4128 transitions. [2025-03-03 14:17:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:17:55,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 76 [2025-03-03 14:17:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:55,876 INFO L225 Difference]: With dead ends: 2519 [2025-03-03 14:17:55,877 INFO L226 Difference]: Without dead ends: 1511 [2025-03-03 14:17:55,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:55,883 INFO L435 NwaCegarLoop]: 960 mSDtfsCounter, 859 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:55,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1752 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:17:55,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2025-03-03 14:17:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1463. [2025-03-03 14:17:55,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1463 states, 1123 states have (on average 1.6482635796972396) internal successors, (1851), 1175 states have internal predecessors, (1851), 271 states have call successors, (271), 68 states have call predecessors, (271), 68 states have return successors, (278), 261 states have call predecessors, (278), 268 states have call successors, (278) [2025-03-03 14:17:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 2400 transitions. [2025-03-03 14:17:55,948 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 2400 transitions. Word has length 76 [2025-03-03 14:17:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:55,949 INFO L471 AbstractCegarLoop]: Abstraction has 1463 states and 2400 transitions. [2025-03-03 14:17:55,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-03 14:17:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 2400 transitions. [2025-03-03 14:17:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:17:55,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:55,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:55,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:56,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:17:56,154 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:56,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:56,155 INFO L85 PathProgramCache]: Analyzing trace with hash 39369632, now seen corresponding path program 1 times [2025-03-03 14:17:56,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:56,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110715395] [2025-03-03 14:17:56,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:56,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:17:56,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:17:56,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:56,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:56,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:56,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110715395] [2025-03-03 14:17:56,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110715395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454223600] [2025-03-03 14:17:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:56,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:56,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:56,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:56,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:56,267 INFO L87 Difference]: Start difference. First operand 1463 states and 2400 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:17:56,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:56,768 INFO L93 Difference]: Finished difference Result 4313 states and 7231 transitions. [2025-03-03 14:17:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2025-03-03 14:17:56,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:56,788 INFO L225 Difference]: With dead ends: 4313 [2025-03-03 14:17:56,788 INFO L226 Difference]: Without dead ends: 2868 [2025-03-03 14:17:56,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:17:56,795 INFO L435 NwaCegarLoop]: 1008 mSDtfsCounter, 890 mSDsluCounter, 3619 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 4627 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:56,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 4627 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:17:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2025-03-03 14:17:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2821. [2025-03-03 14:17:56,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 2167 states have (on average 1.6483617904937702) internal successors, (3572), 2267 states have internal predecessors, (3572), 521 states have call successors, (521), 130 states have call predecessors, (521), 132 states have return successors, (619), 507 states have call predecessors, (619), 517 states have call successors, (619) [2025-03-03 14:17:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4712 transitions. [2025-03-03 14:17:56,923 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4712 transitions. Word has length 78 [2025-03-03 14:17:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:56,923 INFO L471 AbstractCegarLoop]: Abstraction has 2821 states and 4712 transitions. [2025-03-03 14:17:56,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:17:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4712 transitions. [2025-03-03 14:17:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:17:56,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:56,924 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:17:56,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:56,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:56,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1156818030, now seen corresponding path program 1 times [2025-03-03 14:17:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:56,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424717758] [2025-03-03 14:17:56,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:56,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:17:56,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:17:56,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:56,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:17:57,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424717758] [2025-03-03 14:17:57,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424717758] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:17:57,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786520102] [2025-03-03 14:17:57,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:57,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:57,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:17:57,102 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:17:57,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:17:57,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:17:57,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:17:57,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:57,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:57,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1512 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 14:17:57,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:17:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:17:57,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:17:57,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786520102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:57,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:17:57,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-03 14:17:57,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563379779] [2025-03-03 14:17:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:57,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:57,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:57,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:17:57,481 INFO L87 Difference]: Start difference. First operand 2821 states and 4712 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:17:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:58,202 INFO L93 Difference]: Finished difference Result 7636 states and 13034 transitions. [2025-03-03 14:17:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:17:58,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2025-03-03 14:17:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:58,232 INFO L225 Difference]: With dead ends: 7636 [2025-03-03 14:17:58,232 INFO L226 Difference]: Without dead ends: 4833 [2025-03-03 14:17:58,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:17:58,247 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 759 mSDsluCounter, 3169 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 4101 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:58,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 4101 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:17:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-03-03 14:17:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4790. [2025-03-03 14:17:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4790 states, 3676 states have (on average 1.601741022850925) internal successors, (5888), 3842 states have internal predecessors, (5888), 874 states have call successors, (874), 232 states have call predecessors, (874), 239 states have return successors, (1177), 855 states have call predecessors, (1177), 868 states have call successors, (1177) [2025-03-03 14:17:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 7939 transitions. [2025-03-03 14:17:58,445 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 7939 transitions. Word has length 79 [2025-03-03 14:17:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:58,446 INFO L471 AbstractCegarLoop]: Abstraction has 4790 states and 7939 transitions. [2025-03-03 14:17:58,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:17:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 7939 transitions. [2025-03-03 14:17:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:17:58,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:58,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:58,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:17:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:17:58,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash -38020245, now seen corresponding path program 1 times [2025-03-03 14:17:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445766986] [2025-03-03 14:17:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:58,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:17:58,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:17:58,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:58,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:58,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:58,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445766986] [2025-03-03 14:17:58,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445766986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:58,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:58,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:17:58,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738074795] [2025-03-03 14:17:58,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:58,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:17:58,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:58,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:17:58,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:17:58,744 INFO L87 Difference]: Start difference. First operand 4790 states and 7939 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:17:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:59,015 INFO L93 Difference]: Finished difference Result 9586 states and 16053 transitions. [2025-03-03 14:17:59,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:17:59,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-03-03 14:17:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:59,057 INFO L225 Difference]: With dead ends: 9586 [2025-03-03 14:17:59,057 INFO L226 Difference]: Without dead ends: 4814 [2025-03-03 14:17:59,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:17:59,082 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 12 mSDsluCounter, 1735 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:59,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2616 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:17:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2025-03-03 14:17:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4798. [2025-03-03 14:17:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4798 states, 3682 states have (on average 1.6002172732210755) internal successors, (5892), 3848 states have internal predecessors, (5892), 874 states have call successors, (874), 236 states have call predecessors, (874), 241 states have return successors, (1166), 853 states have call predecessors, (1166), 868 states have call successors, (1166) [2025-03-03 14:17:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4798 states to 4798 states and 7932 transitions. [2025-03-03 14:17:59,273 INFO L78 Accepts]: Start accepts. Automaton has 4798 states and 7932 transitions. Word has length 79 [2025-03-03 14:17:59,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:59,274 INFO L471 AbstractCegarLoop]: Abstraction has 4798 states and 7932 transitions. [2025-03-03 14:17:59,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:17:59,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4798 states and 7932 transitions. [2025-03-03 14:17:59,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:17:59,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:59,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:59,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:17:59,276 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:59,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:59,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1677792558, now seen corresponding path program 1 times [2025-03-03 14:17:59,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:59,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130086360] [2025-03-03 14:17:59,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:59,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:59,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:17:59,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:17:59,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:17:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130086360] [2025-03-03 14:17:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130086360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:59,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:59,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:59,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979058080] [2025-03-03 14:17:59,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:59,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:59,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:59,417 INFO L87 Difference]: Start difference. First operand 4798 states and 7932 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:00,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:00,070 INFO L93 Difference]: Finished difference Result 14327 states and 24677 transitions. [2025-03-03 14:18:00,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:00,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 87 [2025-03-03 14:18:00,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:00,132 INFO L225 Difference]: With dead ends: 14327 [2025-03-03 14:18:00,135 INFO L226 Difference]: Without dead ends: 9547 [2025-03-03 14:18:00,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:00,156 INFO L435 NwaCegarLoop]: 969 mSDtfsCounter, 886 mSDsluCounter, 3512 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 4481 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:00,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 4481 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:00,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9547 states. [2025-03-03 14:18:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9547 to 9478. [2025-03-03 14:18:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9478 states, 7276 states have (on average 1.596069268829027) internal successors, (11613), 7602 states have internal predecessors, (11613), 1720 states have call successors, (1720), 466 states have call predecessors, (1720), 481 states have return successors, (2824), 1689 states have call predecessors, (2824), 1710 states have call successors, (2824) [2025-03-03 14:18:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9478 states to 9478 states and 16157 transitions. [2025-03-03 14:18:00,544 INFO L78 Accepts]: Start accepts. Automaton has 9478 states and 16157 transitions. Word has length 87 [2025-03-03 14:18:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:00,545 INFO L471 AbstractCegarLoop]: Abstraction has 9478 states and 16157 transitions. [2025-03-03 14:18:00,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 9478 states and 16157 transitions. [2025-03-03 14:18:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:18:00,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:00,547 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:00,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:18:00,547 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 363666852, now seen corresponding path program 1 times [2025-03-03 14:18:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:00,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741244470] [2025-03-03 14:18:00,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:00,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:18:00,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:18:00,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:00,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:18:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741244470] [2025-03-03 14:18:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741244470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524435962] [2025-03-03 14:18:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:00,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:00,607 INFO L87 Difference]: Start difference. First operand 9478 states and 16157 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:01,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:01,062 INFO L93 Difference]: Finished difference Result 19010 states and 32887 transitions. [2025-03-03 14:18:01,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:01,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-03 14:18:01,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:01,136 INFO L225 Difference]: With dead ends: 19010 [2025-03-03 14:18:01,136 INFO L226 Difference]: Without dead ends: 9550 [2025-03-03 14:18:01,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:01,191 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 12 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:01,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2607 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9550 states. [2025-03-03 14:18:01,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9550 to 9518. [2025-03-03 14:18:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9518 states, 7312 states have (on average 1.5936816192560175) internal successors, (11653), 7630 states have internal predecessors, (11653), 1720 states have call successors, (1720), 482 states have call predecessors, (1720), 485 states have return successors, (2808), 1685 states have call predecessors, (2808), 1710 states have call successors, (2808) [2025-03-03 14:18:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9518 states to 9518 states and 16181 transitions. [2025-03-03 14:18:01,632 INFO L78 Accepts]: Start accepts. Automaton has 9518 states and 16181 transitions. Word has length 88 [2025-03-03 14:18:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:01,633 INFO L471 AbstractCegarLoop]: Abstraction has 9518 states and 16181 transitions. [2025-03-03 14:18:01,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 9518 states and 16181 transitions. [2025-03-03 14:18:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 14:18:01,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:01,634 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:01,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:18:01,635 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:01,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash 86742808, now seen corresponding path program 1 times [2025-03-03 14:18:01,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:01,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175069564] [2025-03-03 14:18:01,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 14:18:01,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 14:18:01,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:01,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:18:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:01,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175069564] [2025-03-03 14:18:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175069564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:01,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:01,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951498510] [2025-03-03 14:18:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:01,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:01,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:01,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:01,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:01,740 INFO L87 Difference]: Start difference. First operand 9518 states and 16181 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:18:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:02,591 INFO L93 Difference]: Finished difference Result 28565 states and 51525 transitions. [2025-03-03 14:18:02,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:02,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2025-03-03 14:18:02,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:02,741 INFO L225 Difference]: With dead ends: 28565 [2025-03-03 14:18:02,741 INFO L226 Difference]: Without dead ends: 19065 [2025-03-03 14:18:02,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:02,798 INFO L435 NwaCegarLoop]: 1002 mSDtfsCounter, 881 mSDsluCounter, 3620 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 4622 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:02,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 4622 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:02,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19065 states. [2025-03-03 14:18:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19065 to 18964. [2025-03-03 14:18:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18964 states, 14572 states have (on average 1.5901043096349163) internal successors, (23171), 15202 states have internal predecessors, (23171), 3418 states have call successors, (3418), 958 states have call predecessors, (3418), 973 states have return successors, (7187), 3363 states have call predecessors, (7187), 3400 states have call successors, (7187) [2025-03-03 14:18:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18964 states to 18964 states and 33776 transitions. [2025-03-03 14:18:03,664 INFO L78 Accepts]: Start accepts. Automaton has 18964 states and 33776 transitions. Word has length 97 [2025-03-03 14:18:03,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:03,665 INFO L471 AbstractCegarLoop]: Abstraction has 18964 states and 33776 transitions. [2025-03-03 14:18:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-03 14:18:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 18964 states and 33776 transitions. [2025-03-03 14:18:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:18:03,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:03,667 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:03,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:18:03,668 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:03,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:03,668 INFO L85 PathProgramCache]: Analyzing trace with hash -564051199, now seen corresponding path program 1 times [2025-03-03 14:18:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934817759] [2025-03-03 14:18:03,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:03,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:18:03,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:18:03,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 14:18:03,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934817759] [2025-03-03 14:18:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934817759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:03,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:03,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701152884] [2025-03-03 14:18:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:03,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:03,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:03,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:03,755 INFO L87 Difference]: Start difference. First operand 18964 states and 33776 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:04,657 INFO L93 Difference]: Finished difference Result 38054 states and 69336 transitions. [2025-03-03 14:18:04,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:04,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-03 14:18:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:04,862 INFO L225 Difference]: With dead ends: 38054 [2025-03-03 14:18:04,862 INFO L226 Difference]: Without dead ends: 19108 [2025-03-03 14:18:04,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:04,977 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 11 mSDsluCounter, 1732 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:04,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2610 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19108 states. [2025-03-03 14:18:05,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19108 to 19044. [2025-03-03 14:18:05,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19044 states, 14644 states have (on average 1.587749248839115) internal successors, (23251), 15274 states have internal predecessors, (23251), 3418 states have call successors, (3418), 974 states have call predecessors, (3418), 981 states have return successors, (7167), 3355 states have call predecessors, (7167), 3400 states have call successors, (7167) [2025-03-03 14:18:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19044 states to 19044 states and 33836 transitions. [2025-03-03 14:18:05,752 INFO L78 Accepts]: Start accepts. Automaton has 19044 states and 33836 transitions. Word has length 98 [2025-03-03 14:18:05,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:05,753 INFO L471 AbstractCegarLoop]: Abstraction has 19044 states and 33836 transitions. [2025-03-03 14:18:05,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-03 14:18:05,753 INFO L276 IsEmpty]: Start isEmpty. Operand 19044 states and 33836 transitions. [2025-03-03 14:18:05,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:18:05,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:05,756 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:05,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:18:05,756 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:05,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash 96858933, now seen corresponding path program 1 times [2025-03-03 14:18:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252731396] [2025-03-03 14:18:05,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:05,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:18:05,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:18:05,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:05,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:18:05,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:05,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252731396] [2025-03-03 14:18:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252731396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:05,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639327527] [2025-03-03 14:18:05,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:05,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:05,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:05,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:05,883 INFO L87 Difference]: Start difference. First operand 19044 states and 33836 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:18:07,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:07,455 INFO L93 Difference]: Finished difference Result 57269 states and 111155 transitions. [2025-03-03 14:18:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-03 14:18:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:07,795 INFO L225 Difference]: With dead ends: 57269 [2025-03-03 14:18:07,795 INFO L226 Difference]: Without dead ends: 38243 [2025-03-03 14:18:07,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:07,909 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 875 mSDsluCounter, 3642 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 4647 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:07,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 4647 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:18:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38243 states. [2025-03-03 14:18:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38243 to 38078. [2025-03-03 14:18:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38078 states, 29284 states have (on average 1.5852001092746892) internal successors, (46421), 30538 states have internal predecessors, (46421), 6820 states have call successors, (6820), 1942 states have call predecessors, (6820), 1973 states have return successors, (19254), 6717 states have call predecessors, (19254), 6786 states have call successors, (19254) [2025-03-03 14:18:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38078 states to 38078 states and 72495 transitions. [2025-03-03 14:18:09,914 INFO L78 Accepts]: Start accepts. Automaton has 38078 states and 72495 transitions. Word has length 108 [2025-03-03 14:18:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:09,916 INFO L471 AbstractCegarLoop]: Abstraction has 38078 states and 72495 transitions. [2025-03-03 14:18:09,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:18:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 38078 states and 72495 transitions. [2025-03-03 14:18:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:18:09,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:09,919 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:09,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:18:09,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:09,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash 899732619, now seen corresponding path program 1 times [2025-03-03 14:18:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:09,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625416984] [2025-03-03 14:18:09,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:09,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:18:09,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:18:09,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:09,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:18:10,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:10,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625416984] [2025-03-03 14:18:10,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625416984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:10,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:10,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972501733] [2025-03-03 14:18:10,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:10,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:10,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:10,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:10,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:10,011 INFO L87 Difference]: Start difference. First operand 38078 states and 72495 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:18:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:11,696 INFO L93 Difference]: Finished difference Result 76458 states and 150717 transitions. [2025-03-03 14:18:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:11,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2025-03-03 14:18:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:12,057 INFO L225 Difference]: With dead ends: 76458 [2025-03-03 14:18:12,057 INFO L226 Difference]: Without dead ends: 38398 [2025-03-03 14:18:12,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:12,344 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 9 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:12,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2607 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38398 states. [2025-03-03 14:18:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38398 to 38270. [2025-03-03 14:18:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38270 states, 29460 states have (on average 1.5822471147318398) internal successors, (46613), 30714 states have internal predecessors, (46613), 6820 states have call successors, (6820), 1974 states have call predecessors, (6820), 1989 states have return successors, (19238), 6701 states have call predecessors, (19238), 6786 states have call successors, (19238) [2025-03-03 14:18:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38270 states to 38270 states and 72671 transitions. [2025-03-03 14:18:14,285 INFO L78 Accepts]: Start accepts. Automaton has 38270 states and 72671 transitions. Word has length 109 [2025-03-03 14:18:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:14,285 INFO L471 AbstractCegarLoop]: Abstraction has 38270 states and 72671 transitions. [2025-03-03 14:18:14,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:18:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 38270 states and 72671 transitions. [2025-03-03 14:18:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-03 14:18:14,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:14,289 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:14,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:18:14,289 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:14,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:14,289 INFO L85 PathProgramCache]: Analyzing trace with hash 551779470, now seen corresponding path program 1 times [2025-03-03 14:18:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760007015] [2025-03-03 14:18:14,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:14,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:18:14,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:18:14,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:14,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:14,520 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-03 14:18:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760007015] [2025-03-03 14:18:14,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760007015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:18:14,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945237219] [2025-03-03 14:18:14,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:14,524 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:18:14,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:18:14,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-03 14:18:14,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-03 14:18:14,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:14,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:14,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 1874 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:18:14,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:18:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:18:15,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:18:15,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945237219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:15,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:18:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-03 14:18:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697672457] [2025-03-03 14:18:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:15,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:18:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:15,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:18:15,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:18:15,005 INFO L87 Difference]: Start difference. First operand 38270 states and 72671 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:18:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:22,323 INFO L93 Difference]: Finished difference Result 136685 states and 280520 transitions. [2025-03-03 14:18:22,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:18:22,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 148 [2025-03-03 14:18:22,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:23,224 INFO L225 Difference]: With dead ends: 136685 [2025-03-03 14:18:23,224 INFO L226 Difference]: Without dead ends: 98433 [2025-03-03 14:18:23,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-03-03 14:18:23,571 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 3071 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 6573 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3249 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 7251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 6573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:23,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3249 Valid, 2457 Invalid, 7251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 6573 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-03 14:18:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98433 states. [2025-03-03 14:18:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98433 to 97160. [2025-03-03 14:18:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97160 states, 74874 states have (on average 1.5750861447231348) internal successors, (117933), 77912 states have internal predecessors, (117933), 17064 states have call successors, (17064), 4934 states have call predecessors, (17064), 5221 states have return successors, (58055), 17049 states have call predecessors, (58055), 16998 states have call successors, (58055) [2025-03-03 14:18:29,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97160 states to 97160 states and 193052 transitions. [2025-03-03 14:18:29,117 INFO L78 Accepts]: Start accepts. Automaton has 97160 states and 193052 transitions. Word has length 148 [2025-03-03 14:18:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:29,117 INFO L471 AbstractCegarLoop]: Abstraction has 97160 states and 193052 transitions. [2025-03-03 14:18:29,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 7 states have internal predecessors, (98), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:18:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 97160 states and 193052 transitions. [2025-03-03 14:18:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:18:29,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:29,119 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:29,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:18:29,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:18:29,323 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:29,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 670771119, now seen corresponding path program 1 times [2025-03-03 14:18:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075891938] [2025-03-03 14:18:29,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:29,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:29,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:18:29,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:18:29,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:29,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:18:29,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:29,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075891938] [2025-03-03 14:18:29,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075891938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:29,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:29,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118924512] [2025-03-03 14:18:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:29,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:29,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:29,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:29,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:29,460 INFO L87 Difference]: Start difference. First operand 97160 states and 193052 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:18:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:35,232 INFO L93 Difference]: Finished difference Result 197295 states and 395963 transitions. [2025-03-03 14:18:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:35,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 5 states have internal predecessors, (76), 4 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2025-03-03 14:18:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:36,425 INFO L225 Difference]: With dead ends: 197295 [2025-03-03 14:18:36,425 INFO L226 Difference]: Without dead ends: 100105 [2025-03-03 14:18:37,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:37,126 INFO L435 NwaCegarLoop]: 941 mSDtfsCounter, 732 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 4366 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:37,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 4366 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:18:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100105 states. [2025-03-03 14:18:40,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100105 to 99942. [2025-03-03 14:18:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99942 states, 77063 states have (on average 1.5675356526478337) internal successors, (120799), 80166 states have internal predecessors, (120799), 17475 states have call successors, (17475), 5131 states have call predecessors, (17475), 5403 states have return successors, (59023), 17367 states have call predecessors, (59023), 17409 states have call successors, (59023)