./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec9_product09.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_spec9_product09.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 cc5b9f71a5434758faa1f6f3febe6f12c158e9feff610b938ef9d4658acd21ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:18:38,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:18:38,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:18:38,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:18:38,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:18:38,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:18:38,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:18:38,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:18:38,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:18:38,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:18:38,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:18:38,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:18:38,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:18:38,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:18:38,131 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:38,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:18:38,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:18:38,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:18:38,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:18:38,133 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 -> cc5b9f71a5434758faa1f6f3febe6f12c158e9feff610b938ef9d4658acd21ff [2025-03-03 14:18:38,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:18:38,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:18:38,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:18:38,364 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:18:38,364 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:18:38,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec9_product09.cil.c [2025-03-03 14:18:39,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb05c17f5/24d63e244a1940e299d93ca0bd38c864/FLAGe24cafaa9 [2025-03-03 14:18:39,790 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:18:39,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product09.cil.c [2025-03-03 14:18:39,820 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb05c17f5/24d63e244a1940e299d93ca0bd38c864/FLAGe24cafaa9 [2025-03-03 14:18:40,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb05c17f5/24d63e244a1940e299d93ca0bd38c864 [2025-03-03 14:18:40,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:18:40,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:18:40,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:40,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:18:40,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:18:40,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40, skipping insertion in model container [2025-03-03 14:18:40,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:18:40,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product09.cil.c[70349,70362] [2025-03-03 14:18:40,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:40,475 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:18:40,481 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2025-03-03 14:18:40,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [62] [2025-03-03 14:18:40,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [730] [2025-03-03 14:18:40,483 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1092] [2025-03-03 14:18:40,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2539] [2025-03-03 14:18:40,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [2905] [2025-03-03 14:18:40,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3065] [2025-03-03 14:18:40,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3184] [2025-03-03 14:18:40,484 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3275] [2025-03-03 14:18:40,485 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3310] [2025-03-03 14:18:40,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product09.cil.c[70349,70362] [2025-03-03 14:18:40,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:18:40,601 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:18:40,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40 WrapperNode [2025-03-03 14:18:40,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:18:40,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:40,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:18:40,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:18:40,608 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:18:40" (1/1) ... [2025-03-03 14:18:40,622 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:18:40" (1/1) ... [2025-03-03 14:18:40,654 INFO L138 Inliner]: procedures = 89, calls = 327, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 767 [2025-03-03 14:18:40,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:18:40,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:18:40,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:18:40,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:18:40,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,701 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-03-03 14:18:40,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:18:40,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:18:40,741 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:18:40,741 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:18:40,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (1/1) ... [2025-03-03 14:18:40,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:18:40,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:18:40,772 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:18:40,775 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:18:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:18:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:18:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:18:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:18:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:18:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:18:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:18:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:18:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:18:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:18:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:18:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:18:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:18:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:18:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:18:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:18:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:18:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:18:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:18:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:18:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:18:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:18:40,797 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:18:40,797 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:18:40,798 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:18:40,798 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:18:40,799 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:18:40,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:18:40,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:18:40,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:18:40,799 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:18:40,799 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:18:40,950 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:18:40,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:18:41,005 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3181: #res := ~retValue_acc~23; [2025-03-03 14:18:41,010 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1168: #res := ~retValue_acc~5; [2025-03-03 14:18:41,307 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1859: #res := ~retValue_acc~13; [2025-03-03 14:18:41,365 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1963: #res := ~retValue_acc~16; [2025-03-03 14:18:41,377 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3142: #res := ~retValue_acc~22; [2025-03-03 14:18:41,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: #res := ~retValue_acc~10; [2025-03-03 14:18:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1365-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~8#1; [2025-03-03 14:18:41,555 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1949-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~15#1; [2025-03-03 14:18:41,556 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1322-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~6#1; [2025-03-03 14:18:41,556 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1331-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~7#1; [2025-03-03 14:18:41,613 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1494-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~11#1; [2025-03-03 14:18:41,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1507-1: isIdle_#res#1 := isIdle_~retValue_acc~12#1; [2025-03-03 14:18:41,689 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L416: #res := ~retValue_acc~1; [2025-03-03 14:18:41,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1089-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-03 14:18:41,745 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3307-1: valid_product_#res#1 := valid_product_~retValue_acc~25#1; [2025-03-03 14:18:41,754 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: #res := ~retValue_acc~0; [2025-03-03 14:18:41,757 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: #res := ~retValue_acc~2; [2025-03-03 14:18:41,880 INFO L? ?]: Removed 415 outVars from TransFormulas that were not future-live. [2025-03-03 14:18:41,880 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:18:41,896 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:18:41,896 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:18:41,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:41 BoogieIcfgContainer [2025-03-03 14:18:41,896 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:18:41,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:18:41,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:18:41,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:18:41,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:18:40" (1/3) ... [2025-03-03 14:18:41,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3159a460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:41, skipping insertion in model container [2025-03-03 14:18:41,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:18:40" (2/3) ... [2025-03-03 14:18:41,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3159a460 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:18:41, skipping insertion in model container [2025-03-03 14:18:41,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:18:41" (3/3) ... [2025-03-03 14:18:41,902 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2025-03-03 14:18:41,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:18:41,913 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec9_product09.cil.c that has 21 procedures, 516 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:18:41,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:18:41,982 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;@55ecc591, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:18:41,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:18:41,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 516 states, 411 states have (on average 1.7201946472019465) internal successors, (707), 432 states have internal predecessors, (707), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-03 14:18:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:18:42,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:42,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:42,014 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:42,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1069204061, now seen corresponding path program 1 times [2025-03-03 14:18:42,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:42,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950060896] [2025-03-03 14:18:42,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:42,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:18:42,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:18:42,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:42,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:42,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950060896] [2025-03-03 14:18:42,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950060896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:42,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:42,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706777300] [2025-03-03 14:18:42,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:42,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:42,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:42,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:42,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:42,468 INFO L87 Difference]: Start difference. First operand has 516 states, 411 states have (on average 1.7201946472019465) internal successors, (707), 432 states have internal predecessors, (707), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:42,608 INFO L93 Difference]: Finished difference Result 1012 states and 1721 transitions. [2025-03-03 14:18:42,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:42,611 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 76 [2025-03-03 14:18:42,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:42,624 INFO L225 Difference]: With dead ends: 1012 [2025-03-03 14:18:42,624 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 14:18:42,630 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:18:42,632 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 5 mSDsluCounter, 1702 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2555 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:42,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2555 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:42,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 14:18:42,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-03 14:18:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 405 states have (on average 1.7185185185185186) internal successors, (696), 424 states have internal predecessors, (696), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 857 transitions. [2025-03-03 14:18:42,712 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 857 transitions. Word has length 76 [2025-03-03 14:18:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 857 transitions. [2025-03-03 14:18:42,713 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 857 transitions. [2025-03-03 14:18:42,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:18:42,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:42,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:42,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:18:42,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:42,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:42,724 INFO L85 PathProgramCache]: Analyzing trace with hash -666900602, now seen corresponding path program 1 times [2025-03-03 14:18:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:42,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119662736] [2025-03-03 14:18:42,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:42,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:18:42,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:18:42,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:42,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:42,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:42,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:42,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119662736] [2025-03-03 14:18:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119662736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:42,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:42,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887974967] [2025-03-03 14:18:42,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:42,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:42,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:42,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:42,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:42,935 INFO L87 Difference]: Start difference. First operand 508 states and 857 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:42,999 INFO L93 Difference]: Finished difference Result 998 states and 1691 transitions. [2025-03-03 14:18:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 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:18:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:43,007 INFO L225 Difference]: With dead ends: 998 [2025-03-03 14:18:43,008 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 14:18:43,010 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:18:43,011 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 4 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:43,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2534 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 14:18:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-03 14:18:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 405 states have (on average 1.7160493827160495) internal successors, (695), 424 states have internal predecessors, (695), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 856 transitions. [2025-03-03 14:18:43,049 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 856 transitions. Word has length 79 [2025-03-03 14:18:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:43,050 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 856 transitions. [2025-03-03 14:18:43,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,050 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 856 transitions. [2025-03-03 14:18:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 14:18:43,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:43,054 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:43,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:18:43,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:43,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1692836233, now seen corresponding path program 1 times [2025-03-03 14:18:43,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:43,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175654201] [2025-03-03 14:18:43,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:43,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 14:18:43,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 14:18:43,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:43,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175654201] [2025-03-03 14:18:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175654201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:43,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445108266] [2025-03-03 14:18:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:43,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:43,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:43,206 INFO L87 Difference]: Start difference. First operand 508 states and 856 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:43,275 INFO L93 Difference]: Finished difference Result 998 states and 1690 transitions. [2025-03-03 14:18:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2025-03-03 14:18:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:43,280 INFO L225 Difference]: With dead ends: 998 [2025-03-03 14:18:43,280 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 14:18:43,283 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:18:43,283 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 3 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2534 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:18:43,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2534 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 14:18:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-03 14:18:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 405 states have (on average 1.7135802469135804) internal successors, (694), 424 states have internal predecessors, (694), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 855 transitions. [2025-03-03 14:18:43,312 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 855 transitions. Word has length 80 [2025-03-03 14:18:43,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:43,313 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 855 transitions. [2025-03-03 14:18:43,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,314 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 855 transitions. [2025-03-03 14:18:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:18:43,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:43,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:43,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:18:43,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:43,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:43,319 INFO L85 PathProgramCache]: Analyzing trace with hash -434416061, now seen corresponding path program 1 times [2025-03-03 14:18:43,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:43,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394400050] [2025-03-03 14:18:43,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:43,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:18:43,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:18:43,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:43,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:43,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:43,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394400050] [2025-03-03 14:18:43,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394400050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:43,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:43,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:43,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353270139] [2025-03-03 14:18:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:43,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:43,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:43,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:43,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:43,463 INFO L87 Difference]: Start difference. First operand 508 states and 855 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:43,514 INFO L93 Difference]: Finished difference Result 998 states and 1689 transitions. [2025-03-03 14:18:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:43,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-03-03 14:18:43,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:43,523 INFO L225 Difference]: With dead ends: 998 [2025-03-03 14:18:43,523 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 14:18:43,526 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:18:43,527 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 2 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:43,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2534 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 14:18:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-03 14:18:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 405 states have (on average 1.711111111111111) internal successors, (693), 424 states have internal predecessors, (693), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 854 transitions. [2025-03-03 14:18:43,552 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 854 transitions. Word has length 81 [2025-03-03 14:18:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:43,552 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 854 transitions. [2025-03-03 14:18:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 854 transitions. [2025-03-03 14:18:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 14:18:43,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:43,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:18:43,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1375410028, now seen corresponding path program 1 times [2025-03-03 14:18:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303983014] [2025-03-03 14:18:43,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:43,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 14:18:43,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 14:18:43,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:43,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303983014] [2025-03-03 14:18:43,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303983014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:43,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:43,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:43,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697408181] [2025-03-03 14:18:43,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:43,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:43,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:43,694 INFO L87 Difference]: Start difference. First operand 508 states and 854 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:43,731 INFO L93 Difference]: Finished difference Result 998 states and 1688 transitions. [2025-03-03 14:18:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 82 [2025-03-03 14:18:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:43,736 INFO L225 Difference]: With dead ends: 998 [2025-03-03 14:18:43,736 INFO L226 Difference]: Without dead ends: 508 [2025-03-03 14:18:43,738 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:18:43,738 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 1 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:43,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2534 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-03-03 14:18:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2025-03-03 14:18:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 405 states have (on average 1.708641975308642) internal successors, (692), 424 states have internal predecessors, (692), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 853 transitions. [2025-03-03 14:18:43,761 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 853 transitions. Word has length 82 [2025-03-03 14:18:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:43,762 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 853 transitions. [2025-03-03 14:18:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 853 transitions. [2025-03-03 14:18:43,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:18:43,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:43,765 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:18:43,765 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1778765568, now seen corresponding path program 1 times [2025-03-03 14:18:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671237872] [2025-03-03 14:18:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:43,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:18:43,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:18:43,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:43,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:43,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671237872] [2025-03-03 14:18:43,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671237872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:43,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:18:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747087337] [2025-03-03 14:18:43,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:43,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:18:43,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:43,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:18:43,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:18:43,982 INFO L87 Difference]: Start difference. First operand 508 states and 853 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:44,100 INFO L93 Difference]: Finished difference Result 964 states and 1620 transitions. [2025-03-03 14:18:44,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:18:44,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-03-03 14:18:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:44,104 INFO L225 Difference]: With dead ends: 964 [2025-03-03 14:18:44,104 INFO L226 Difference]: Without dead ends: 523 [2025-03-03 14:18:44,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:44,107 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 91 mSDsluCounter, 5804 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6645 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:44,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6645 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-03 14:18:44,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2025-03-03 14:18:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 415 states have (on average 1.7036144578313253) internal successors, (707), 436 states have internal predecessors, (707), 84 states have call successors, (84), 20 states have call predecessors, (84), 21 states have return successors, (81), 77 states have call predecessors, (81), 79 states have call successors, (81) [2025-03-03 14:18:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 872 transitions. [2025-03-03 14:18:44,134 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 872 transitions. Word has length 83 [2025-03-03 14:18:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:44,134 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 872 transitions. [2025-03-03 14:18:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 872 transitions. [2025-03-03 14:18:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:18:44,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:44,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:44,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:18:44,139 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:44,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 2734367, now seen corresponding path program 1 times [2025-03-03 14:18:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072267026] [2025-03-03 14:18:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:44,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:18:44,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:18:44,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:44,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:44,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:44,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072267026] [2025-03-03 14:18:44,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072267026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:44,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:44,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:44,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130332130] [2025-03-03 14:18:44,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:44,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:44,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:44,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:44,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:44,230 INFO L87 Difference]: Start difference. First operand 521 states and 872 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:44,268 INFO L93 Difference]: Finished difference Result 1016 states and 1714 transitions. [2025-03-03 14:18:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:44,269 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2025-03-03 14:18:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:44,272 INFO L225 Difference]: With dead ends: 1016 [2025-03-03 14:18:44,272 INFO L226 Difference]: Without dead ends: 502 [2025-03-03 14:18:44,274 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:18:44,274 INFO L435 NwaCegarLoop]: 847 mSDtfsCounter, 0 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:44,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2536 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:44,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-03-03 14:18:44,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2025-03-03 14:18:44,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 399 states have (on average 1.699248120300752) internal successors, (678), 418 states have internal predecessors, (678), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:44,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 839 transitions. [2025-03-03 14:18:44,289 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 839 transitions. Word has length 83 [2025-03-03 14:18:44,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:44,289 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 839 transitions. [2025-03-03 14:18:44,290 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:44,290 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 839 transitions. [2025-03-03 14:18:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 14:18:44,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:44,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:44,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:18:44,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:44,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:44,292 INFO L85 PathProgramCache]: Analyzing trace with hash -670147983, now seen corresponding path program 1 times [2025-03-03 14:18:44,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:44,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822980669] [2025-03-03 14:18:44,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:44,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:44,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 14:18:44,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 14:18:44,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:44,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822980669] [2025-03-03 14:18:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822980669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944093960] [2025-03-03 14:18:44,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:44,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:44,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:44,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:44,400 INFO L87 Difference]: Start difference. First operand 502 states and 839 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:44,558 INFO L93 Difference]: Finished difference Result 961 states and 1612 transitions. [2025-03-03 14:18:44,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:44,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-03 14:18:44,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:44,562 INFO L225 Difference]: With dead ends: 961 [2025-03-03 14:18:44,562 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:18:44,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:44,565 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 55 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:44,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3951 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:44,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:18:44,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2025-03-03 14:18:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 399 states have (on average 1.6892230576441103) internal successors, (674), 418 states have internal predecessors, (674), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 835 transitions. [2025-03-03 14:18:44,582 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 835 transitions. Word has length 84 [2025-03-03 14:18:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:44,582 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 835 transitions. [2025-03-03 14:18:44,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 835 transitions. [2025-03-03 14:18:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:18:44,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:44,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:44,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:18:44,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:44,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:44,585 INFO L85 PathProgramCache]: Analyzing trace with hash -470885897, now seen corresponding path program 1 times [2025-03-03 14:18:44,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:44,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4806600] [2025-03-03 14:18:44,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:44,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:44,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:18:44,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:18:44,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:44,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:44,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:44,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4806600] [2025-03-03 14:18:44,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4806600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:44,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:44,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134620292] [2025-03-03 14:18:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:44,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:44,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:44,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:44,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:44,721 INFO L87 Difference]: Start difference. First operand 502 states and 835 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:44,856 INFO L93 Difference]: Finished difference Result 961 states and 1608 transitions. [2025-03-03 14:18:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:44,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-03-03 14:18:44,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:44,861 INFO L225 Difference]: With dead ends: 961 [2025-03-03 14:18:44,861 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:18:44,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:44,863 INFO L435 NwaCegarLoop]: 796 mSDtfsCounter, 54 mSDsluCounter, 3155 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3951 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:44,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3951 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:18:44,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2025-03-03 14:18:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 399 states have (on average 1.6791979949874687) internal successors, (670), 418 states have internal predecessors, (670), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 831 transitions. [2025-03-03 14:18:44,878 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 831 transitions. Word has length 85 [2025-03-03 14:18:44,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:44,878 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 831 transitions. [2025-03-03 14:18:44,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:44,879 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 831 transitions. [2025-03-03 14:18:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:18:44,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:44,881 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:44,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:18:44,881 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:44,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1489797428, now seen corresponding path program 1 times [2025-03-03 14:18:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544864722] [2025-03-03 14:18:44,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:44,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:18:44,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:18:44,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:44,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:44,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:44,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544864722] [2025-03-03 14:18:44,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544864722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:44,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:44,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566789843] [2025-03-03 14:18:44,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:44,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:44,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:44,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:44,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:44,993 INFO L87 Difference]: Start difference. First operand 502 states and 831 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:45,117 INFO L93 Difference]: Finished difference Result 961 states and 1604 transitions. [2025-03-03 14:18:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-03 14:18:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,121 INFO L225 Difference]: With dead ends: 961 [2025-03-03 14:18:45,121 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 14:18:45,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:45,124 INFO L435 NwaCegarLoop]: 795 mSDtfsCounter, 53 mSDsluCounter, 3138 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 3933 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:45,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 3933 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 14:18:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 502. [2025-03-03 14:18:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 399 states have (on average 1.669172932330827) internal successors, (666), 418 states have internal predecessors, (666), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 827 transitions. [2025-03-03 14:18:45,138 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 827 transitions. Word has length 86 [2025-03-03 14:18:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:45,138 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 827 transitions. [2025-03-03 14:18:45,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 827 transitions. [2025-03-03 14:18:45,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:18:45,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:45,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:45,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:18:45,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:45,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1940688989, now seen corresponding path program 1 times [2025-03-03 14:18:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:45,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086889546] [2025-03-03 14:18:45,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:45,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:45,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:18:45,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:18:45,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:45,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:45,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:45,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086889546] [2025-03-03 14:18:45,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086889546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:45,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:45,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852332342] [2025-03-03 14:18:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:45,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:45,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:45,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:45,260 INFO L87 Difference]: Start difference. First operand 502 states and 827 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:45,317 INFO L93 Difference]: Finished difference Result 952 states and 1586 transitions. [2025-03-03 14:18:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:18:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2025-03-03 14:18:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,322 INFO L225 Difference]: With dead ends: 952 [2025-03-03 14:18:45,322 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 14:18:45,324 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:18:45,325 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 84 mSDsluCounter, 4007 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 4823 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:45,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 4823 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:45,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 14:18:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-03-03 14:18:45,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 378 states have (on average 1.6719576719576719) internal successors, (632), 397 states have internal predecessors, (632), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 793 transitions. [2025-03-03 14:18:45,341 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 793 transitions. Word has length 86 [2025-03-03 14:18:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:45,341 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 793 transitions. [2025-03-03 14:18:45,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 793 transitions. [2025-03-03 14:18:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:18:45,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:45,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:45,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:18:45,344 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:45,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:45,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2075002982, now seen corresponding path program 1 times [2025-03-03 14:18:45,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:45,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918202767] [2025-03-03 14:18:45,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:45,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:45,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:18:45,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:18:45,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:45,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918202767] [2025-03-03 14:18:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918202767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:45,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:45,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:45,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152934552] [2025-03-03 14:18:45,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:45,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:45,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:45,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:45,457 INFO L87 Difference]: Start difference. First operand 481 states and 793 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:45,518 INFO L93 Difference]: Finished difference Result 931 states and 1552 transitions. [2025-03-03 14:18:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:45,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 87 [2025-03-03 14:18:45,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,522 INFO L225 Difference]: With dead ends: 931 [2025-03-03 14:18:45,522 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 14:18:45,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:45,524 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 17 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:45,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3871 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 14:18:45,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-03-03 14:18:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 378 states have (on average 1.6693121693121693) internal successors, (631), 397 states have internal predecessors, (631), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 792 transitions. [2025-03-03 14:18:45,539 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 792 transitions. Word has length 87 [2025-03-03 14:18:45,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:45,539 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 792 transitions. [2025-03-03 14:18:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 792 transitions. [2025-03-03 14:18:45,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:18:45,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:45,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:45,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:18:45,541 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:45,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:45,542 INFO L85 PathProgramCache]: Analyzing trace with hash -836140041, now seen corresponding path program 1 times [2025-03-03 14:18:45,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880614506] [2025-03-03 14:18:45,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:45,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:18:45,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:18:45,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:45,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:45,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:45,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880614506] [2025-03-03 14:18:45,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880614506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:45,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:45,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:45,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488513338] [2025-03-03 14:18:45,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:45,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:45,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:45,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:45,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:45,644 INFO L87 Difference]: Start difference. First operand 481 states and 792 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:45,704 INFO L93 Difference]: Finished difference Result 931 states and 1551 transitions. [2025-03-03 14:18:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:18:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-03 14:18:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,709 INFO L225 Difference]: With dead ends: 931 [2025-03-03 14:18:45,709 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 14:18:45,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:45,712 INFO L435 NwaCegarLoop]: 776 mSDtfsCounter, 16 mSDsluCounter, 3095 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:45,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3871 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:45,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 14:18:45,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-03-03 14:18:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 378 states have (on average 1.6666666666666667) internal successors, (630), 397 states have internal predecessors, (630), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 791 transitions. [2025-03-03 14:18:45,727 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 791 transitions. Word has length 88 [2025-03-03 14:18:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:45,728 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 791 transitions. [2025-03-03 14:18:45,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 791 transitions. [2025-03-03 14:18:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:18:45,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:45,731 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:45,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:18:45,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:45,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:45,732 INFO L85 PathProgramCache]: Analyzing trace with hash -727218690, now seen corresponding path program 1 times [2025-03-03 14:18:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:45,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164058666] [2025-03-03 14:18:45,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:45,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:18:45,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:18:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:45,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:45,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164058666] [2025-03-03 14:18:45,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164058666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:45,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:45,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:18:45,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338837751] [2025-03-03 14:18:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:45,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:18:45,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:45,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:18:45,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:18:45,809 INFO L87 Difference]: Start difference. First operand 481 states and 791 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:45,836 INFO L93 Difference]: Finished difference Result 931 states and 1550 transitions. [2025-03-03 14:18:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:18:45,837 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-03-03 14:18:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:45,840 INFO L225 Difference]: With dead ends: 931 [2025-03-03 14:18:45,841 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 14:18:45,842 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:18:45,843 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 9 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:45,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2346 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:45,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 14:18:45,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-03-03 14:18:45,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 378 states have (on average 1.664021164021164) internal successors, (629), 397 states have internal predecessors, (629), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 790 transitions. [2025-03-03 14:18:45,858 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 790 transitions. Word has length 89 [2025-03-03 14:18:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:45,858 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 790 transitions. [2025-03-03 14:18:45,858 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, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:18:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 790 transitions. [2025-03-03 14:18:45,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:18:45,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:45,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:45,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:18:45,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1007568579, now seen corresponding path program 1 times [2025-03-03 14:18:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921148534] [2025-03-03 14:18:45,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:45,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:18:45,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:18:45,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:45,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:46,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:46,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921148534] [2025-03-03 14:18:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921148534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:18:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027428102] [2025-03-03 14:18:46,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:46,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:18:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:46,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:18:46,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:46,023 INFO L87 Difference]: Start difference. First operand 481 states and 790 transitions. Second operand has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:46,106 INFO L93 Difference]: Finished difference Result 925 states and 1538 transitions. [2025-03-03 14:18:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:18:46,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2025-03-03 14:18:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:46,110 INFO L225 Difference]: With dead ends: 925 [2025-03-03 14:18:46,110 INFO L226 Difference]: Without dead ends: 481 [2025-03-03 14:18:46,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:18:46,112 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 5 mSDsluCounter, 6171 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6945 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:46,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6945 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-03 14:18:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2025-03-03 14:18:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 378 states have (on average 1.6613756613756614) internal successors, (628), 397 states have internal predecessors, (628), 83 states have call successors, (83), 20 states have call predecessors, (83), 19 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-03 14:18:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 789 transitions. [2025-03-03 14:18:46,125 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 789 transitions. Word has length 89 [2025-03-03 14:18:46,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:46,125 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 789 transitions. [2025-03-03 14:18:46,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:46,125 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 789 transitions. [2025-03-03 14:18:46,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 14:18:46,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:46,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:46,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:18:46,128 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:46,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:46,128 INFO L85 PathProgramCache]: Analyzing trace with hash -519874838, now seen corresponding path program 1 times [2025-03-03 14:18:46,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:46,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229072894] [2025-03-03 14:18:46,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:46,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:46,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 14:18:46,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 14:18:46,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:46,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229072894] [2025-03-03 14:18:46,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229072894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:46,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:46,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:18:46,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548653309] [2025-03-03 14:18:46,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:46,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:18:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:46,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:18:46,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:18:46,320 INFO L87 Difference]: Start difference. First operand 481 states and 789 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:47,654 INFO L93 Difference]: Finished difference Result 921 states and 1550 transitions. [2025-03-03 14:18:47,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:47,654 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 90 [2025-03-03 14:18:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:47,658 INFO L225 Difference]: With dead ends: 921 [2025-03-03 14:18:47,658 INFO L226 Difference]: Without dead ends: 485 [2025-03-03 14:18:47,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:18:47,660 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 1222 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 2770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:47,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 1535 Invalid, 2770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2428 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:18:47,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-03 14:18:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2025-03-03 14:18:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.6561679790026247) internal successors, (631), 400 states have internal predecessors, (631), 83 states have call successors, (83), 20 states have call predecessors, (83), 20 states have return successors, (94), 77 states have call predecessors, (94), 78 states have call successors, (94) [2025-03-03 14:18:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 808 transitions. [2025-03-03 14:18:47,678 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 808 transitions. Word has length 90 [2025-03-03 14:18:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:47,678 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 808 transitions. [2025-03-03 14:18:47,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-03 14:18:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 808 transitions. [2025-03-03 14:18:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 14:18:47,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:47,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:47,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:18:47,680 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:47,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash -583316200, now seen corresponding path program 1 times [2025-03-03 14:18:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:47,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478811022] [2025-03-03 14:18:47,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:47,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 14:18:47,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 14:18:47,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:47,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:47,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478811022] [2025-03-03 14:18:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478811022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:47,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877475786] [2025-03-03 14:18:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:47,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:47,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:47,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:47,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:47,812 INFO L87 Difference]: Start difference. First operand 485 states and 808 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:50,274 INFO L93 Difference]: Finished difference Result 1707 states and 2943 transitions. [2025-03-03 14:18:50,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:18:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 91 [2025-03-03 14:18:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:50,283 INFO L225 Difference]: With dead ends: 1707 [2025-03-03 14:18:50,283 INFO L226 Difference]: Without dead ends: 1267 [2025-03-03 14:18:50,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:18:50,286 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2204 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 4363 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2263 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 4363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:50,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2263 Valid, 2343 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 4363 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:18:50,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-03-03 14:18:50,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1208. [2025-03-03 14:18:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 946 states have (on average 1.6712473572938689) internal successors, (1581), 994 states have internal predecessors, (1581), 210 states have call successors, (210), 51 states have call predecessors, (210), 51 states have return successors, (225), 199 states have call predecessors, (225), 205 states have call successors, (225) [2025-03-03 14:18:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 2016 transitions. [2025-03-03 14:18:50,339 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 2016 transitions. Word has length 91 [2025-03-03 14:18:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:50,340 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 2016 transitions. [2025-03-03 14:18:50,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2016 transitions. [2025-03-03 14:18:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:18:50,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:50,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:50,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:18:50,342 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 222144583, now seen corresponding path program 1 times [2025-03-03 14:18:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832250167] [2025-03-03 14:18:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:50,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:18:50,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:18:50,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:50,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832250167] [2025-03-03 14:18:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832250167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016505731] [2025-03-03 14:18:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:50,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:50,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:50,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:50,478 INFO L87 Difference]: Start difference. First operand 1208 states and 2016 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:53,543 INFO L93 Difference]: Finished difference Result 5596 states and 9655 transitions. [2025-03-03 14:18:53,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:18:53,544 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2025-03-03 14:18:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:53,582 INFO L225 Difference]: With dead ends: 5596 [2025-03-03 14:18:53,582 INFO L226 Difference]: Without dead ends: 4433 [2025-03-03 14:18:53,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:18:53,594 INFO L435 NwaCegarLoop]: 739 mSDtfsCounter, 2934 mSDsluCounter, 1870 mSDsCounter, 0 mSdLazyCounter, 5086 mSolverCounterSat, 769 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 5855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 769 IncrementalHoareTripleChecker+Valid, 5086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:53,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 2609 Invalid, 5855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [769 Valid, 5086 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 14:18:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2025-03-03 14:18:53,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 3954. [2025-03-03 14:18:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 2923 states have (on average 1.6657543619568935) internal successors, (4869), 3135 states have internal predecessors, (4869), 877 states have call successors, (877), 137 states have call predecessors, (877), 153 states have return successors, (1071), 855 states have call predecessors, (1071), 872 states have call successors, (1071) [2025-03-03 14:18:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 6817 transitions. [2025-03-03 14:18:53,804 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 6817 transitions. Word has length 93 [2025-03-03 14:18:53,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:53,806 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 6817 transitions. [2025-03-03 14:18:53,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:53,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 6817 transitions. [2025-03-03 14:18:53,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:18:53,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:53,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:53,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:18:53,808 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:53,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 645791305, now seen corresponding path program 1 times [2025-03-03 14:18:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218177920] [2025-03-03 14:18:53,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:53,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:18:53,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:18:53,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:53,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:53,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218177920] [2025-03-03 14:18:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218177920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674462259] [2025-03-03 14:18:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:53,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:53,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:53,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:53,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:53,912 INFO L87 Difference]: Start difference. First operand 3954 states and 6817 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:55,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:55,921 INFO L93 Difference]: Finished difference Result 10483 states and 18191 transitions. [2025-03-03 14:18:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:18:55,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 93 [2025-03-03 14:18:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:55,971 INFO L225 Difference]: With dead ends: 10483 [2025-03-03 14:18:55,972 INFO L226 Difference]: Without dead ends: 7621 [2025-03-03 14:18:55,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 14:18:55,989 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 2201 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 3383 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 3829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 3383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:55,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 1677 Invalid, 3829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 3383 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 14:18:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7621 states. [2025-03-03 14:18:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7621 to 7322. [2025-03-03 14:18:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7322 states, 5452 states have (on average 1.6632428466617755) internal successors, (9068), 5842 states have internal predecessors, (9068), 1557 states have call successors, (1557), 254 states have call predecessors, (1557), 312 states have return successors, (2030), 1516 states have call predecessors, (2030), 1552 states have call successors, (2030) [2025-03-03 14:18:56,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7322 states to 7322 states and 12655 transitions. [2025-03-03 14:18:56,386 INFO L78 Accepts]: Start accepts. Automaton has 7322 states and 12655 transitions. Word has length 93 [2025-03-03 14:18:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:56,386 INFO L471 AbstractCegarLoop]: Abstraction has 7322 states and 12655 transitions. [2025-03-03 14:18:56,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 5 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-03 14:18:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7322 states and 12655 transitions. [2025-03-03 14:18:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:18:56,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:56,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:56,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:18:56,389 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:56,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1653865903, now seen corresponding path program 1 times [2025-03-03 14:18:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:56,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027486539] [2025-03-03 14:18:56,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:56,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:56,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:18:56,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:18:56,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:56,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:56,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:56,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027486539] [2025-03-03 14:18:56,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027486539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:56,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:56,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:18:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631274691] [2025-03-03 14:18:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:56,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:18:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:56,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:18:56,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:56,531 INFO L87 Difference]: Start difference. First operand 7322 states and 12655 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:56,846 INFO L93 Difference]: Finished difference Result 13474 states and 23351 transitions. [2025-03-03 14:18:56,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:18:56,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 98 [2025-03-03 14:18:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:56,885 INFO L225 Difference]: With dead ends: 13474 [2025-03-03 14:18:56,885 INFO L226 Difference]: Without dead ends: 7409 [2025-03-03 14:18:56,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:18:56,905 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 0 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:56,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3118 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:18:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7409 states. [2025-03-03 14:18:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7409 to 7395. [2025-03-03 14:18:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7395 states, 5508 states have (on average 1.6559549745824256) internal successors, (9121), 5897 states have internal predecessors, (9121), 1554 states have call successors, (1554), 254 states have call predecessors, (1554), 332 states have return successors, (2093), 1534 states have call predecessors, (2093), 1549 states have call successors, (2093) [2025-03-03 14:18:57,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7395 states to 7395 states and 12768 transitions. [2025-03-03 14:18:57,260 INFO L78 Accepts]: Start accepts. Automaton has 7395 states and 12768 transitions. Word has length 98 [2025-03-03 14:18:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:57,260 INFO L471 AbstractCegarLoop]: Abstraction has 7395 states and 12768 transitions. [2025-03-03 14:18:57,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-03 14:18:57,260 INFO L276 IsEmpty]: Start isEmpty. Operand 7395 states and 12768 transitions. [2025-03-03 14:18:57,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:18:57,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:57,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:57,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:18:57,263 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:57,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash 2057483824, now seen corresponding path program 1 times [2025-03-03 14:18:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334805584] [2025-03-03 14:18:57,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:57,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:57,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 14:18:57,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 14:18:57,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:57,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:18:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334805584] [2025-03-03 14:18:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334805584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:18:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748871534] [2025-03-03 14:18:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:18:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:57,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:18:57,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:18:57,367 INFO L87 Difference]: Start difference. First operand 7395 states and 12768 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:57,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:18:57,862 INFO L93 Difference]: Finished difference Result 14700 states and 25824 transitions. [2025-03-03 14:18:57,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:18:57,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 105 [2025-03-03 14:18:57,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:18:57,918 INFO L225 Difference]: With dead ends: 14700 [2025-03-03 14:18:57,919 INFO L226 Difference]: Without dead ends: 7543 [2025-03-03 14:18:57,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:57,952 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 225 mSDsluCounter, 3063 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:18:57,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3892 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:18:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7543 states. [2025-03-03 14:18:58,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7543 to 7419. [2025-03-03 14:18:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7419 states, 5529 states have (on average 1.6317598119008863) internal successors, (9022), 5921 states have internal predecessors, (9022), 1554 states have call successors, (1554), 254 states have call predecessors, (1554), 335 states have return successors, (2105), 1534 states have call predecessors, (2105), 1549 states have call successors, (2105) [2025-03-03 14:18:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7419 states to 7419 states and 12681 transitions. [2025-03-03 14:18:58,449 INFO L78 Accepts]: Start accepts. Automaton has 7419 states and 12681 transitions. Word has length 105 [2025-03-03 14:18:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:18:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 7419 states and 12681 transitions. [2025-03-03 14:18:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-03 14:18:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 7419 states and 12681 transitions. [2025-03-03 14:18:58,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:18:58,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:18:58,454 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:18:58,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:18:58,455 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:18:58,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:18:58,455 INFO L85 PathProgramCache]: Analyzing trace with hash 842045721, now seen corresponding path program 1 times [2025-03-03 14:18:58,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:18:58,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376054920] [2025-03-03 14:18:58,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:18:58,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:18:58,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:18:58,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:18:58,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:18:58,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:18:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:18:58,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:18:58,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376054920] [2025-03-03 14:18:58,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376054920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:18:58,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:18:58,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:18:58,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683080564] [2025-03-03 14:18:58,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:18:58,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:18:58,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:18:58,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:18:58,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:18:58,646 INFO L87 Difference]: Start difference. First operand 7419 states and 12681 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:19:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:00,305 INFO L93 Difference]: Finished difference Result 14113 states and 24157 transitions. [2025-03-03 14:19:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:19:00,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 110 [2025-03-03 14:19:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:00,362 INFO L225 Difference]: With dead ends: 14113 [2025-03-03 14:19:00,362 INFO L226 Difference]: Without dead ends: 7967 [2025-03-03 14:19:00,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-03 14:19:00,393 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1950 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2017 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:00,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2017 Valid, 1488 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:19:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7967 states. [2025-03-03 14:19:00,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7967 to 7650. [2025-03-03 14:19:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7650 states, 5702 states have (on average 1.6199579095054366) internal successors, (9237), 6112 states have internal predecessors, (9237), 1571 states have call successors, (1571), 280 states have call predecessors, (1571), 376 states have return successors, (2194), 1548 states have call predecessors, (2194), 1566 states have call successors, (2194) [2025-03-03 14:19:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 13002 transitions. [2025-03-03 14:19:00,769 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 13002 transitions. Word has length 110 [2025-03-03 14:19:00,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:00,769 INFO L471 AbstractCegarLoop]: Abstraction has 7650 states and 13002 transitions. [2025-03-03 14:19:00,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 5 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-03 14:19:00,769 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 13002 transitions. [2025-03-03 14:19:00,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:19:00,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:00,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:00,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:19:00,772 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:00,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:00,772 INFO L85 PathProgramCache]: Analyzing trace with hash -698290492, now seen corresponding path program 1 times [2025-03-03 14:19:00,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:00,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551034278] [2025-03-03 14:19:00,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:00,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:00,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:19:00,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:19:00,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:00,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:00,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:00,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551034278] [2025-03-03 14:19:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551034278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:00,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:00,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 14:19:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710134834] [2025-03-03 14:19:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 14:19:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:00,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 14:19:00,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:19:00,943 INFO L87 Difference]: Start difference. First operand 7650 states and 13002 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:03,190 INFO L93 Difference]: Finished difference Result 16127 states and 27135 transitions. [2025-03-03 14:19:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:19:03,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 117 [2025-03-03 14:19:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:03,246 INFO L225 Difference]: With dead ends: 16127 [2025-03-03 14:19:03,246 INFO L226 Difference]: Without dead ends: 9569 [2025-03-03 14:19:03,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-03 14:19:03,272 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 2759 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 5101 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2830 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 5704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 5101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:03,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2830 Valid, 2181 Invalid, 5704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 5101 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:19:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9569 states. [2025-03-03 14:19:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9569 to 9124. [2025-03-03 14:19:03,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9124 states, 6868 states have (on average 1.5952242283051834) internal successors, (10956), 7337 states have internal predecessors, (10956), 1754 states have call successors, (1754), 367 states have call predecessors, (1754), 501 states have return successors, (2467), 1710 states have call predecessors, (2467), 1749 states have call successors, (2467) [2025-03-03 14:19:03,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9124 states to 9124 states and 15177 transitions. [2025-03-03 14:19:03,756 INFO L78 Accepts]: Start accepts. Automaton has 9124 states and 15177 transitions. Word has length 117 [2025-03-03 14:19:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:03,757 INFO L471 AbstractCegarLoop]: Abstraction has 9124 states and 15177 transitions. [2025-03-03 14:19:03,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:19:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 9124 states and 15177 transitions. [2025-03-03 14:19:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:19:03,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:03,760 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:03,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:19:03,760 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:03,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:03,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1157904330, now seen corresponding path program 1 times [2025-03-03 14:19:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:03,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490295551] [2025-03-03 14:19:03,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:03,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:19:03,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:19:03,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:03,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:03,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:03,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490295551] [2025-03-03 14:19:03,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490295551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:03,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:19:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978432501] [2025-03-03 14:19:03,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:03,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:19:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:03,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:19:03,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:03,876 INFO L87 Difference]: Start difference. First operand 9124 states and 15177 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:19:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:04,518 INFO L93 Difference]: Finished difference Result 21442 states and 35762 transitions. [2025-03-03 14:19:04,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:19:04,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-03 14:19:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:04,611 INFO L225 Difference]: With dead ends: 21442 [2025-03-03 14:19:04,611 INFO L226 Difference]: Without dead ends: 13591 [2025-03-03 14:19:04,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:19:04,646 INFO L435 NwaCegarLoop]: 1291 mSDtfsCounter, 722 mSDsluCounter, 3336 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 4627 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:04,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 4627 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:19:04,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13591 states. [2025-03-03 14:19:05,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13591 to 11737. [2025-03-03 14:19:05,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11737 states, 8814 states have (on average 1.6091445427728615) internal successors, (14183), 9416 states have internal predecessors, (14183), 2313 states have call successors, (2313), 450 states have call predecessors, (2313), 609 states have return successors, (3194), 2278 states have call predecessors, (3194), 2308 states have call successors, (3194) [2025-03-03 14:19:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11737 states to 11737 states and 19690 transitions. [2025-03-03 14:19:05,181 INFO L78 Accepts]: Start accepts. Automaton has 11737 states and 19690 transitions. Word has length 115 [2025-03-03 14:19:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:05,182 INFO L471 AbstractCegarLoop]: Abstraction has 11737 states and 19690 transitions. [2025-03-03 14:19:05,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:19:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 11737 states and 19690 transitions. [2025-03-03 14:19:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:19:05,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:05,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:19:05,184 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 336120164, now seen corresponding path program 1 times [2025-03-03 14:19:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757575362] [2025-03-03 14:19:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:05,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:19:05,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:19:05,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:05,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:05,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:05,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757575362] [2025-03-03 14:19:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757575362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:05,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:05,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579200284] [2025-03-03 14:19:05,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:05,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:05,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:05,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:05,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:05,329 INFO L87 Difference]: Start difference. First operand 11737 states and 19690 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:08,765 INFO L93 Difference]: Finished difference Result 40939 states and 71314 transitions. [2025-03-03 14:19:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:19:08,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-03-03 14:19:08,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:08,980 INFO L225 Difference]: With dead ends: 40939 [2025-03-03 14:19:08,980 INFO L226 Difference]: Without dead ends: 29247 [2025-03-03 14:19:09,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:09,048 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 3051 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 4899 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3086 SdHoareTripleChecker+Valid, 2821 SdHoareTripleChecker+Invalid, 5777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 4899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:09,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3086 Valid, 2821 Invalid, 5777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 4899 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 14:19:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29247 states. [2025-03-03 14:19:10,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29247 to 29046. [2025-03-03 14:19:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29046 states, 20474 states have (on average 1.584888150825437) internal successors, (32449), 22277 states have internal predecessors, (32449), 7269 states have call successors, (7269), 895 states have call predecessors, (7269), 1302 states have return successors, (10336), 7249 states have call predecessors, (10336), 7264 states have call successors, (10336) [2025-03-03 14:19:10,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29046 states to 29046 states and 50054 transitions. [2025-03-03 14:19:10,887 INFO L78 Accepts]: Start accepts. Automaton has 29046 states and 50054 transitions. Word has length 117 [2025-03-03 14:19:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:10,888 INFO L471 AbstractCegarLoop]: Abstraction has 29046 states and 50054 transitions. [2025-03-03 14:19:10,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:19:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29046 states and 50054 transitions. [2025-03-03 14:19:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:19:10,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:10,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:10,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:19:10,890 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:10,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:10,891 INFO L85 PathProgramCache]: Analyzing trace with hash -935444183, now seen corresponding path program 1 times [2025-03-03 14:19:10,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59501008] [2025-03-03 14:19:10,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:10,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:19:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:19:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:11,220 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:11,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59501008] [2025-03-03 14:19:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59501008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:11,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:11,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826855789] [2025-03-03 14:19:11,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:11,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:11,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:11,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:11,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:11,221 INFO L87 Difference]: Start difference. First operand 29046 states and 50054 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:19:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:19:17,876 INFO L93 Difference]: Finished difference Result 108399 states and 194993 transitions. [2025-03-03 14:19:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:19:17,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2025-03-03 14:19:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:19:18,652 INFO L225 Difference]: With dead ends: 108399 [2025-03-03 14:19:18,652 INFO L226 Difference]: Without dead ends: 79398 [2025-03-03 14:19:18,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:19:18,798 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 3055 mSDsluCounter, 2543 mSDsCounter, 0 mSdLazyCounter, 6058 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3090 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 6933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 6058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:19:18,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3090 Valid, 3328 Invalid, 6933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 6058 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 14:19:18,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79398 states. [2025-03-03 14:19:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79398 to 79013. [2025-03-03 14:19:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79013 states, 51830 states have (on average 1.5590391665058847) internal successors, (80805), 57463 states have internal predecessors, (80805), 24342 states have call successors, (24342), 1785 states have call predecessors, (24342), 2840 states have return successors, (36160), 24518 states have call predecessors, (36160), 24337 states have call successors, (36160) [2025-03-03 14:19:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79013 states to 79013 states and 141307 transitions. [2025-03-03 14:19:24,311 INFO L78 Accepts]: Start accepts. Automaton has 79013 states and 141307 transitions. Word has length 116 [2025-03-03 14:19:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:19:24,311 INFO L471 AbstractCegarLoop]: Abstraction has 79013 states and 141307 transitions. [2025-03-03 14:19:24,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:19:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 79013 states and 141307 transitions. [2025-03-03 14:19:24,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:19:24,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:19:24,314 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:19:24,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:19:24,315 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:19:24,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:19:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1691414783, now seen corresponding path program 1 times [2025-03-03 14:19:24,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:19:24,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432191957] [2025-03-03 14:19:24,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:19:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:19:24,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:19:24,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:19:24,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:19:24,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:19:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:19:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:19:24,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432191957] [2025-03-03 14:19:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432191957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:19:24,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:19:24,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 14:19:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287758670] [2025-03-03 14:19:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:19:24,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:19:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:19:24,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:19:24,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:19:24,457 INFO L87 Difference]: Start difference. First operand 79013 states and 141307 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13)