./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product30.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_spec2_product30.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 b3416b3e017f399176a4f7a837e050107ced7390b025fd07360efb8b6075a94d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:16:47,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:16:47,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:16:47,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:16:47,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:16:47,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:16:47,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:16:47,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:16:47,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:16:47,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:16:47,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:16:47,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:16:47,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:16:47,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:16:47,799 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:16:47,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:47,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:16:47,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:16:47,800 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 -> b3416b3e017f399176a4f7a837e050107ced7390b025fd07360efb8b6075a94d [2025-03-03 14:16:48,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:16:48,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:16:48,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:16:48,036 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:16:48,037 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:16:48,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c [2025-03-03 14:16:49,197 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe641055/5734c177bc534d119e18e08bb7154dec/FLAG8e71db436 [2025-03-03 14:16:49,535 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:16:49,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c [2025-03-03 14:16:49,558 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe641055/5734c177bc534d119e18e08bb7154dec/FLAG8e71db436 [2025-03-03 14:16:49,575 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fe641055/5734c177bc534d119e18e08bb7154dec [2025-03-03 14:16:49,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:16:49,579 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:16:49,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:49,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:16:49,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:16:49,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:49" (1/1) ... [2025-03-03 14:16:49,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4412e5fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:49, skipping insertion in model container [2025-03-03 14:16:49,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:16:49" (1/1) ... [2025-03-03 14:16:49,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:16:49,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c[10611,10624] [2025-03-03 14:16:50,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:50,056 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:16:50,062 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2025-03-03 14:16:50,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [169] [2025-03-03 14:16:50,063 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [532] [2025-03-03 14:16:50,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [627] [2025-03-03 14:16:50,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [636] [2025-03-03 14:16:50,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1303] [2025-03-03 14:16:50,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1338] [2025-03-03 14:16:50,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [1350] [2025-03-03 14:16:50,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1533] [2025-03-03 14:16:50,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3112] [2025-03-03 14:16:50,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product30.cil.c[10611,10624] [2025-03-03 14:16:50,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:16:50,172 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:16:50,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50 WrapperNode [2025-03-03 14:16:50,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:16:50,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:50,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:16:50,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:16:50,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,192 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:16:50" (1/1) ... [2025-03-03 14:16:50,223 INFO L138 Inliner]: procedures = 95, calls = 347, calls flagged for inlining = 28, calls inlined = 24, statements flattened = 916 [2025-03-03 14:16:50,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:16:50,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:16:50,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:16:50,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:16:50,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,270 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:16:50,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,289 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:16:50,300 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:16:50,300 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:16:50,300 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:16:50,301 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (1/1) ... [2025-03-03 14:16:50,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:16:50,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:16:50,332 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:16:50,334 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:16:50,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:16:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-03-03 14:16:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-03-03 14:16:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-03 14:16:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-03 14:16:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-03 14:16:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-03 14:16:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-03 14:16:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-03 14:16:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-03 14:16:50,353 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-03 14:16:50,353 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:16:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2025-03-03 14:16:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-03 14:16:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-03 14:16:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-03 14:16:50,354 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-03 14:16:50,354 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-03 14:16:50,355 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-03 14:16:50,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-03 14:16:50,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-03 14:16:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-03 14:16:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-03 14:16:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-03 14:16:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-03 14:16:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-03 14:16:50,357 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-03 14:16:50,357 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-03 14:16:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-03 14:16:50,358 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-03 14:16:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-03 14:16:50,358 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-03 14:16:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-03 14:16:50,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-03 14:16:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:16:50,358 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2025-03-03 14:16:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:16:50,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:16:50,358 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-03 14:16:50,358 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-03 14:16:50,517 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:16:50,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:16:50,566 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L166: #res := ~retValue_acc~2; [2025-03-03 14:16:50,581 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: #res := ~retValue_acc~0; [2025-03-03 14:16:50,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605: #res := ~retValue_acc~10; [2025-03-03 14:16:50,605 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: #res := ~retValue_acc~11; [2025-03-03 14:16:50,792 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2358: #res#1 := ~retValue_acc~19#1; [2025-03-03 14:16:50,792 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2392-1: isAnyLiftButtonPressed_#res#1 := isAnyLiftButtonPressed_~retValue_acc~20#1; [2025-03-03 14:16:50,861 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2490: #res := ~retValue_acc~23; [2025-03-03 14:16:50,875 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L127: #res := ~retValue_acc~1; [2025-03-03 14:16:50,998 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2319: #res := ~retValue_acc~18; [2025-03-03 14:16:51,007 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825: #res := ~retValue_acc~13; [2025-03-03 14:16:51,056 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1874-1: isEmpty_#res#1 := isEmpty_~retValue_acc~15#1; [2025-03-03 14:16:51,112 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1954-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-03 14:16:51,112 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1967-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-03 14:16:51,201 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: #res := ~retValue_acc~6; [2025-03-03 14:16:51,277 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2448-1: stopRequestedAtCurrentFloor__wrappee__empty_#res#1 := stopRequestedAtCurrentFloor__wrappee__empty_~retValue_acc~21#1; [2025-03-03 14:16:51,277 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2476-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~22#1; [2025-03-03 14:16:51,340 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L529-1: main_#res#1 := main_~retValue_acc~4#1; [2025-03-03 14:16:51,340 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1335-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-03-03 14:16:51,349 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: #res := ~retValue_acc~5; [2025-03-03 14:16:51,351 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1791: #res := ~retValue_acc~12; [2025-03-03 14:16:51,357 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1300: #res := ~retValue_acc~7; [2025-03-03 14:16:51,503 INFO L? ?]: Removed 462 outVars from TransFormulas that were not future-live. [2025-03-03 14:16:51,503 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:16:51,524 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:16:51,524 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:16:51,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:51 BoogieIcfgContainer [2025-03-03 14:16:51,525 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:16:51,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:16:51,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:16:51,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:16:51,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:16:49" (1/3) ... [2025-03-03 14:16:51,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e46273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:51, skipping insertion in model container [2025-03-03 14:16:51,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:16:50" (2/3) ... [2025-03-03 14:16:51,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e46273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:16:51, skipping insertion in model container [2025-03-03 14:16:51,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:16:51" (3/3) ... [2025-03-03 14:16:51,534 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product30.cil.c [2025-03-03 14:16:51,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:16:51,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product30.cil.c that has 26 procedures, 580 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:16:51,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:16:51,603 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;@6d3aba70, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:16:51,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:16:51,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 580 states, 455 states have (on average 1.6923076923076923) internal successors, (770), 478 states have internal predecessors, (770), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-03 14:16:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 14:16:51,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:51,620 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:51,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:51,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:51,625 INFO L85 PathProgramCache]: Analyzing trace with hash -339320541, now seen corresponding path program 1 times [2025-03-03 14:16:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:51,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969583031] [2025-03-03 14:16:51,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:51,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:51,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 14:16:51,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 14:16:51,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:51,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:52,049 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:16:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969583031] [2025-03-03 14:16:52,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969583031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:52,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:52,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728070157] [2025-03-03 14:16:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:52,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:52,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:52,078 INFO L87 Difference]: Start difference. First operand has 580 states, 455 states have (on average 1.6923076923076923) internal successors, (770), 478 states have internal predecessors, (770), 98 states have call successors, (98), 25 states have call predecessors, (98), 25 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:52,213 INFO L93 Difference]: Finished difference Result 1140 states and 1907 transitions. [2025-03-03 14:16:52,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:52,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2025-03-03 14:16:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:52,228 INFO L225 Difference]: With dead ends: 1140 [2025-03-03 14:16:52,228 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:16:52,234 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:16:52,236 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 5 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2834 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:16:52,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2834 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:52,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:16:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:16:52,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6904231625835189) internal successors, (759), 470 states have internal predecessors, (759), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 950 transitions. [2025-03-03 14:16:52,311 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 950 transitions. Word has length 60 [2025-03-03 14:16:52,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:52,312 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 950 transitions. [2025-03-03 14:16:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 950 transitions. [2025-03-03 14:16:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 14:16:52,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:52,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:52,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:16:52,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:52,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:52,320 INFO L85 PathProgramCache]: Analyzing trace with hash 41884875, now seen corresponding path program 1 times [2025-03-03 14:16:52,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:52,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611790413] [2025-03-03 14:16:52,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:52,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:52,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 14:16:52,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 14:16:52,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:52,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:52,493 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:16:52,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:52,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611790413] [2025-03-03 14:16:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611790413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:52,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:52,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:52,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946803305] [2025-03-03 14:16:52,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:52,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:52,497 INFO L87 Difference]: Start difference. First operand 572 states and 950 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:52,563 INFO L93 Difference]: Finished difference Result 1126 states and 1877 transitions. [2025-03-03 14:16:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-03-03 14:16:52,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:52,569 INFO L225 Difference]: With dead ends: 1126 [2025-03-03 14:16:52,569 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:16:52,572 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:16:52,573 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 4 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2813 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:16:52,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2813 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:16:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:16:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.688195991091314) internal successors, (758), 470 states have internal predecessors, (758), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 949 transitions. [2025-03-03 14:16:52,606 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 949 transitions. Word has length 63 [2025-03-03 14:16:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:52,606 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 949 transitions. [2025-03-03 14:16:52,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 949 transitions. [2025-03-03 14:16:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 14:16:52,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:52,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:52,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:16:52,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:52,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:52,612 INFO L85 PathProgramCache]: Analyzing trace with hash 72450429, now seen corresponding path program 1 times [2025-03-03 14:16:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:52,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779839253] [2025-03-03 14:16:52,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:52,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 14:16:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 14:16:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:52,768 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:16:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779839253] [2025-03-03 14:16:52,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779839253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:52,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:52,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445807284] [2025-03-03 14:16:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:52,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:52,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:52,770 INFO L87 Difference]: Start difference. First operand 572 states and 949 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:52,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:52,830 INFO L93 Difference]: Finished difference Result 1126 states and 1876 transitions. [2025-03-03 14:16:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:52,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-03-03 14:16:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:52,836 INFO L225 Difference]: With dead ends: 1126 [2025-03-03 14:16:52,836 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:16:52,839 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:16:52,841 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 3 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2813 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:16:52,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2813 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:16:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:16:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6859688195991092) internal successors, (757), 470 states have internal predecessors, (757), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 948 transitions. [2025-03-03 14:16:52,870 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 948 transitions. Word has length 64 [2025-03-03 14:16:52,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:52,870 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 948 transitions. [2025-03-03 14:16:52,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 948 transitions. [2025-03-03 14:16:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 14:16:52,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:52,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:16:52,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1486938712, now seen corresponding path program 1 times [2025-03-03 14:16:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742125978] [2025-03-03 14:16:52,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:52,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 14:16:52,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 14:16:52,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:53,003 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:16:53,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:53,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742125978] [2025-03-03 14:16:53,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742125978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:53,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615543114] [2025-03-03 14:16:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:53,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:53,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:53,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:53,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:53,005 INFO L87 Difference]: Start difference. First operand 572 states and 948 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:53,050 INFO L93 Difference]: Finished difference Result 1126 states and 1875 transitions. [2025-03-03 14:16:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2025-03-03 14:16:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:53,054 INFO L225 Difference]: With dead ends: 1126 [2025-03-03 14:16:53,055 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:16:53,057 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:16:53,058 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 2 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2813 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:16:53,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2813 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:53,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:16:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:16:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6837416481069043) internal successors, (756), 470 states have internal predecessors, (756), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 947 transitions. [2025-03-03 14:16:53,110 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 947 transitions. Word has length 65 [2025-03-03 14:16:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:53,110 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 947 transitions. [2025-03-03 14:16:53,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,111 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 947 transitions. [2025-03-03 14:16:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 14:16:53,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:53,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:53,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:16:53,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:53,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -795315846, now seen corresponding path program 1 times [2025-03-03 14:16:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047830955] [2025-03-03 14:16:53,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:53,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 14:16:53,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 14:16:53,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:53,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:53,213 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:16:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:53,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047830955] [2025-03-03 14:16:53,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047830955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:53,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:53,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:53,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864669224] [2025-03-03 14:16:53,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:53,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:53,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:53,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:53,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:53,214 INFO L87 Difference]: Start difference. First operand 572 states and 947 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:53,251 INFO L93 Difference]: Finished difference Result 1126 states and 1874 transitions. [2025-03-03 14:16:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-03 14:16:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:53,255 INFO L225 Difference]: With dead ends: 1126 [2025-03-03 14:16:53,255 INFO L226 Difference]: Without dead ends: 572 [2025-03-03 14:16:53,258 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:16:53,258 INFO L435 NwaCegarLoop]: 939 mSDtfsCounter, 1 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2813 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:16:53,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2813 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-03-03 14:16:53,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-03-03 14:16:53,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6815144766146994) internal successors, (755), 470 states have internal predecessors, (755), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 946 transitions. [2025-03-03 14:16:53,278 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 946 transitions. Word has length 66 [2025-03-03 14:16:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:53,278 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 946 transitions. [2025-03-03 14:16:53,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 946 transitions. [2025-03-03 14:16:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:53,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:53,280 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:53,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:16:53,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 958202501, now seen corresponding path program 1 times [2025-03-03 14:16:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222013952] [2025-03-03 14:16:53,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:53,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:53,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:53,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:53,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:53,440 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:16:53,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222013952] [2025-03-03 14:16:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222013952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184604342] [2025-03-03 14:16:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:53,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:53,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:53,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:53,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:53,442 INFO L87 Difference]: Start difference. First operand 572 states and 946 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:53,522 INFO L93 Difference]: Finished difference Result 1092 states and 1806 transitions. [2025-03-03 14:16:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2025-03-03 14:16:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:53,527 INFO L225 Difference]: With dead ends: 1092 [2025-03-03 14:16:53,527 INFO L226 Difference]: Without dead ends: 587 [2025-03-03 14:16:53,529 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:16:53,529 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 91 mSDsluCounter, 4599 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5535 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:53,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5535 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-03-03 14:16:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2025-03-03 14:16:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 459 states have (on average 1.6775599128540306) internal successors, (770), 482 states have internal predecessors, (770), 99 states have call successors, (99), 25 states have call predecessors, (99), 26 states have return successors, (96), 91 states have call predecessors, (96), 94 states have call successors, (96) [2025-03-03 14:16:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 965 transitions. [2025-03-03 14:16:53,551 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 965 transitions. Word has length 67 [2025-03-03 14:16:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:53,552 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 965 transitions. [2025-03-03 14:16:53,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 965 transitions. [2025-03-03 14:16:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 14:16:53,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:53,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] [2025-03-03 14:16:53,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:16:53,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:53,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 717662372, now seen corresponding path program 1 times [2025-03-03 14:16:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116054428] [2025-03-03 14:16:53,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:53,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 14:16:53,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 14:16:53,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:53,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:53,615 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:16:53,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:53,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116054428] [2025-03-03 14:16:53,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116054428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:53,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:53,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:53,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582482253] [2025-03-03 14:16:53,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:53,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:53,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:53,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:53,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:53,617 INFO L87 Difference]: Start difference. First operand 585 states and 965 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:53,646 INFO L93 Difference]: Finished difference Result 1144 states and 1900 transitions. [2025-03-03 14:16:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:53,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-03-03 14:16:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:53,663 INFO L225 Difference]: With dead ends: 1144 [2025-03-03 14:16:53,663 INFO L226 Difference]: Without dead ends: 566 [2025-03-03 14:16:53,665 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:16:53,665 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 0 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2815 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:16:53,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2815 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-03 14:16:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-03-03 14:16:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.672686230248307) internal successors, (741), 464 states have internal predecessors, (741), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 932 transitions. [2025-03-03 14:16:53,679 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 932 transitions. Word has length 67 [2025-03-03 14:16:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:53,679 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 932 transitions. [2025-03-03 14:16:53,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 932 transitions. [2025-03-03 14:16:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 14:16:53,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:53,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:53,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:16:53,681 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:53,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:53,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1839171996, now seen corresponding path program 1 times [2025-03-03 14:16:53,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:53,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004775578] [2025-03-03 14:16:53,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:53,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:53,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 14:16:53,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 14:16:53,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:53,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:53,776 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:16:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004775578] [2025-03-03 14:16:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004775578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163964934] [2025-03-03 14:16:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:53,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:53,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:53,778 INFO L87 Difference]: Start difference. First operand 566 states and 932 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:53,925 INFO L93 Difference]: Finished difference Result 1089 states and 1798 transitions. [2025-03-03 14:16:53,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:53,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-03-03 14:16:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:53,928 INFO L225 Difference]: With dead ends: 1089 [2025-03-03 14:16:53,928 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 14:16:53,930 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:16:53,930 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 55 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4416 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:16:53,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4416 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:53,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 14:16:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2025-03-03 14:16:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.6636568848758464) internal successors, (737), 464 states have internal predecessors, (737), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 928 transitions. [2025-03-03 14:16:53,944 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 928 transitions. Word has length 68 [2025-03-03 14:16:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:53,944 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 928 transitions. [2025-03-03 14:16:53,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:53,945 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 928 transitions. [2025-03-03 14:16:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 14:16:53,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:53,946 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:53,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:16:53,946 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -882800836, now seen corresponding path program 1 times [2025-03-03 14:16:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001324303] [2025-03-03 14:16:53,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:53,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 14:16:53,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 14:16:53,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:53,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,058 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:16:54,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:54,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001324303] [2025-03-03 14:16:54,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001324303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:54,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:54,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:54,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863591161] [2025-03-03 14:16:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:54,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:54,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:54,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:54,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:54,059 INFO L87 Difference]: Start difference. First operand 566 states and 928 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:54,218 INFO L93 Difference]: Finished difference Result 1089 states and 1794 transitions. [2025-03-03 14:16:54,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:54,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-03-03 14:16:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:54,223 INFO L225 Difference]: With dead ends: 1089 [2025-03-03 14:16:54,223 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 14:16:54,226 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:16:54,226 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 54 mSDsluCounter, 3527 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 4416 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:16:54,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 4416 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 14:16:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2025-03-03 14:16:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.654627539503386) internal successors, (733), 464 states have internal predecessors, (733), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 924 transitions. [2025-03-03 14:16:54,249 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 924 transitions. Word has length 69 [2025-03-03 14:16:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:54,249 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 924 transitions. [2025-03-03 14:16:54,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 924 transitions. [2025-03-03 14:16:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:54,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:54,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:54,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:16:54,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:54,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:54,251 INFO L85 PathProgramCache]: Analyzing trace with hash 300625255, now seen corresponding path program 1 times [2025-03-03 14:16:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:54,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357785428] [2025-03-03 14:16:54,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:54,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:54,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:54,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:54,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:54,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,348 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:16:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357785428] [2025-03-03 14:16:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357785428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:54,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246746609] [2025-03-03 14:16:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:54,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:54,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:54,349 INFO L87 Difference]: Start difference. First operand 566 states and 924 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:54,494 INFO L93 Difference]: Finished difference Result 1089 states and 1790 transitions. [2025-03-03 14:16:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-03-03 14:16:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:54,498 INFO L225 Difference]: With dead ends: 1089 [2025-03-03 14:16:54,498 INFO L226 Difference]: Without dead ends: 575 [2025-03-03 14:16:54,500 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:16:54,500 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 53 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4398 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:16:54,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4398 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:16:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-03 14:16:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 566. [2025-03-03 14:16:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 443 states have (on average 1.6455981941309255) internal successors, (729), 464 states have internal predecessors, (729), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 920 transitions. [2025-03-03 14:16:54,514 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 920 transitions. Word has length 70 [2025-03-03 14:16:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:54,514 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 920 transitions. [2025-03-03 14:16:54,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 920 transitions. [2025-03-03 14:16:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:16:54,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:54,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:54,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:16:54,515 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:54,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:54,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2023938518, now seen corresponding path program 1 times [2025-03-03 14:16:54,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:54,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584342234] [2025-03-03 14:16:54,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:54,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 14:16:54,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:16:54,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:54,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,602 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:16:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584342234] [2025-03-03 14:16:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584342234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:54,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:54,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:16:54,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562277265] [2025-03-03 14:16:54,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:54,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:16:54,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:54,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:16:54,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:16:54,603 INFO L87 Difference]: Start difference. First operand 566 states and 920 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:54,653 INFO L93 Difference]: Finished difference Result 1080 states and 1772 transitions. [2025-03-03 14:16:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:16:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 70 [2025-03-03 14:16:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:54,658 INFO L225 Difference]: With dead ends: 1080 [2025-03-03 14:16:54,658 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:16:54,660 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:16:54,660 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 84 mSDsluCounter, 4472 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 5381 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:16:54,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 5381 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:16:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:16:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.646919431279621) internal successors, (695), 443 states have internal predecessors, (695), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 886 transitions. [2025-03-03 14:16:54,674 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 886 transitions. Word has length 70 [2025-03-03 14:16:54,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:54,675 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 886 transitions. [2025-03-03 14:16:54,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-03 14:16:54,675 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 886 transitions. [2025-03-03 14:16:54,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 14:16:54,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:54,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:54,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:16:54,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:54,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:54,676 INFO L85 PathProgramCache]: Analyzing trace with hash -67180385, now seen corresponding path program 1 times [2025-03-03 14:16:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:54,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691631006] [2025-03-03 14:16:54,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:54,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:54,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 14:16:54,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 14:16:54,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:54,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,785 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:16:54,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:54,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691631006] [2025-03-03 14:16:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691631006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:54,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:54,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5974114] [2025-03-03 14:16:54,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:54,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:54,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:54,787 INFO L87 Difference]: Start difference. First operand 545 states and 886 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:54,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:54,851 INFO L93 Difference]: Finished difference Result 1059 states and 1738 transitions. [2025-03-03 14:16:54,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:54,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-03-03 14:16:54,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:54,855 INFO L225 Difference]: With dead ends: 1059 [2025-03-03 14:16:54,855 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:16:54,858 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:16:54,858 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 17 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4336 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:16:54,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4336 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:16:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:16:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6445497630331753) internal successors, (694), 443 states have internal predecessors, (694), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 885 transitions. [2025-03-03 14:16:54,875 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 885 transitions. Word has length 71 [2025-03-03 14:16:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:54,876 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 885 transitions. [2025-03-03 14:16:54,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 885 transitions. [2025-03-03 14:16:54,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 14:16:54,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:54,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:54,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:16:54,878 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:54,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1278529430, now seen corresponding path program 1 times [2025-03-03 14:16:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:54,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718664589] [2025-03-03 14:16:54,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:54,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:54,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 14:16:54,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 14:16:54,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:54,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:54,967 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:16:54,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:54,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718664589] [2025-03-03 14:16:54,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718664589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:54,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:54,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:54,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229619507] [2025-03-03 14:16:54,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:54,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:54,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:54,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:54,968 INFO L87 Difference]: Start difference. First operand 545 states and 885 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:55,025 INFO L93 Difference]: Finished difference Result 1059 states and 1737 transitions. [2025-03-03 14:16:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:55,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2025-03-03 14:16:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:55,029 INFO L225 Difference]: With dead ends: 1059 [2025-03-03 14:16:55,029 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:16:55,031 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:16:55,032 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 16 mSDsluCounter, 3467 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4336 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:16:55,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4336 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:16:55,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:16:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6421800947867298) internal successors, (693), 443 states have internal predecessors, (693), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 884 transitions. [2025-03-03 14:16:55,046 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 884 transitions. Word has length 72 [2025-03-03 14:16:55,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:55,046 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 884 transitions. [2025-03-03 14:16:55,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 884 transitions. [2025-03-03 14:16:55,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 14:16:55,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:55,047 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:55,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:16:55,047 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1425047042, now seen corresponding path program 1 times [2025-03-03 14:16:55,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542144357] [2025-03-03 14:16:55,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:55,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 14:16:55,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 14:16:55,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:55,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:55,129 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:16:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542144357] [2025-03-03 14:16:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542144357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:55,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:55,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:16:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626677940] [2025-03-03 14:16:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:55,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:16:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:55,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:16:55,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:16:55,130 INFO L87 Difference]: Start difference. First operand 545 states and 884 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:55,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:55,165 INFO L93 Difference]: Finished difference Result 1053 states and 1725 transitions. [2025-03-03 14:16:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:16:55,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2025-03-03 14:16:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:55,169 INFO L225 Difference]: With dead ends: 1053 [2025-03-03 14:16:55,170 INFO L226 Difference]: Without dead ends: 545 [2025-03-03 14:16:55,172 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:16:55,172 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 5 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2606 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:55,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2606 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:16:55,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-03 14:16:55,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2025-03-03 14:16:55,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 422 states have (on average 1.6398104265402844) internal successors, (692), 443 states have internal predecessors, (692), 98 states have call successors, (98), 25 states have call predecessors, (98), 24 states have return successors, (93), 90 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-03 14:16:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 883 transitions. [2025-03-03 14:16:55,189 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 883 transitions. Word has length 73 [2025-03-03 14:16:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:55,190 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 883 transitions. [2025-03-03 14:16:55,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 14:16:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 883 transitions. [2025-03-03 14:16:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 14:16:55,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:55,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:16:55,192 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:55,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:55,193 INFO L85 PathProgramCache]: Analyzing trace with hash -162475107, now seen corresponding path program 1 times [2025-03-03 14:16:55,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:55,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523250888] [2025-03-03 14:16:55,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:55,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:55,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 14:16:55,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 14:16:55,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:55,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:55,371 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:16:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523250888] [2025-03-03 14:16:55,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523250888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:55,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:55,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:16:55,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266297206] [2025-03-03 14:16:55,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:55,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:16:55,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:55,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:16:55,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:16:55,372 INFO L87 Difference]: Start difference. First operand 545 states and 883 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:16:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:57,408 INFO L93 Difference]: Finished difference Result 1684 states and 2790 transitions. [2025-03-03 14:16:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:16:57,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 74 [2025-03-03 14:16:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:57,417 INFO L225 Difference]: With dead ends: 1684 [2025-03-03 14:16:57,417 INFO L226 Difference]: Without dead ends: 1184 [2025-03-03 14:16:57,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:57,421 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 3268 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 784 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3335 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 784 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:57,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3335 Valid, 1041 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [784 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 14:16:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2025-03-03 14:16:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1062. [2025-03-03 14:16:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 827 states have (on average 1.6590084643288996) internal successors, (1372), 857 states have internal predecessors, (1372), 190 states have call successors, (190), 43 states have call predecessors, (190), 44 states have return successors, (192), 174 states have call predecessors, (192), 185 states have call successors, (192) [2025-03-03 14:16:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1754 transitions. [2025-03-03 14:16:57,477 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1754 transitions. Word has length 74 [2025-03-03 14:16:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:57,477 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1754 transitions. [2025-03-03 14:16:57,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 14:16:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1754 transitions. [2025-03-03 14:16:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:16:57,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:57,481 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:16:57,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash 29967718, now seen corresponding path program 1 times [2025-03-03 14:16:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385570146] [2025-03-03 14:16:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:57,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:16:57,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:16:57,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:57,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:57,738 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:16:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:57,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385570146] [2025-03-03 14:16:57,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385570146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:57,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:16:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430853692] [2025-03-03 14:16:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:57,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:16:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:57,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:16:57,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:16:57,740 INFO L87 Difference]: Start difference. First operand 1062 states and 1754 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:16:59,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:16:59,179 INFO L93 Difference]: Finished difference Result 2087 states and 3510 transitions. [2025-03-03 14:16:59,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:16:59,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 113 [2025-03-03 14:16:59,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:16:59,188 INFO L225 Difference]: With dead ends: 2087 [2025-03-03 14:16:59,189 INFO L226 Difference]: Without dead ends: 1070 [2025-03-03 14:16:59,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:16:59,196 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 1345 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 2827 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:16:59,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1606 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2827 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 14:16:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-03 14:16:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-03-03 14:16:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 833 states have (on average 1.6542617046818728) internal successors, (1378), 863 states have internal predecessors, (1378), 190 states have call successors, (190), 43 states have call predecessors, (190), 46 states have return successors, (224), 176 states have call predecessors, (224), 185 states have call successors, (224) [2025-03-03 14:16:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1792 transitions. [2025-03-03 14:16:59,250 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1792 transitions. Word has length 113 [2025-03-03 14:16:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:16:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1792 transitions. [2025-03-03 14:16:59,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 5 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:16:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1792 transitions. [2025-03-03 14:16:59,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:16:59,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:16:59,254 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:16:59,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:16:59,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:16:59,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:16:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1550985924, now seen corresponding path program 1 times [2025-03-03 14:16:59,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:16:59,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567470854] [2025-03-03 14:16:59,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:16:59,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:16:59,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:16:59,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:16:59,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:16:59,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:16:59,547 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:16:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:16:59,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567470854] [2025-03-03 14:16:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567470854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:16:59,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:16:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:16:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162468447] [2025-03-03 14:16:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:16:59,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:16:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:16:59,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:16:59,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:16:59,549 INFO L87 Difference]: Start difference. First operand 1070 states and 1792 transitions. Second operand has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 14:17:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:04,385 INFO L93 Difference]: Finished difference Result 3904 states and 6577 transitions. [2025-03-03 14:17:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 14:17:04,386 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 113 [2025-03-03 14:17:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:04,402 INFO L225 Difference]: With dead ends: 3904 [2025-03-03 14:17:04,402 INFO L226 Difference]: Without dead ends: 2879 [2025-03-03 14:17:04,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=899, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:17:04,408 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 2914 mSDsluCounter, 6382 mSDsCounter, 0 mSdLazyCounter, 12898 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2992 SdHoareTripleChecker+Valid, 7141 SdHoareTripleChecker+Invalid, 13834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 12898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:04,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2992 Valid, 7141 Invalid, 13834 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [936 Valid, 12898 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-03 14:17:04,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2025-03-03 14:17:04,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2781. [2025-03-03 14:17:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2092 states have (on average 1.621414913957935) internal successors, (3392), 2168 states have internal predecessors, (3392), 566 states have call successors, (566), 99 states have call predecessors, (566), 122 states have return successors, (665), 546 states have call predecessors, (665), 561 states have call successors, (665) [2025-03-03 14:17:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 4623 transitions. [2025-03-03 14:17:04,554 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 4623 transitions. Word has length 113 [2025-03-03 14:17:04,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:04,554 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 4623 transitions. [2025-03-03 14:17:04,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.333333333333333) internal successors, (88), 11 states have internal predecessors, (88), 7 states have call successors, (13), 3 states have call predecessors, (13), 5 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-03 14:17:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 4623 transitions. [2025-03-03 14:17:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:17:04,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:04,557 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:04,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:17:04,558 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:04,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1487474084, now seen corresponding path program 1 times [2025-03-03 14:17:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:04,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386145627] [2025-03-03 14:17:04,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:04,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:17:04,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:17:04,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:04,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:04,714 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:17:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386145627] [2025-03-03 14:17:04,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386145627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:04,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:04,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:17:04,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924031847] [2025-03-03 14:17:04,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:04,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:17:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:04,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:17:04,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:17:04,716 INFO L87 Difference]: Start difference. First operand 2781 states and 4623 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:17:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:06,896 INFO L93 Difference]: Finished difference Result 8933 states and 15228 transitions. [2025-03-03 14:17:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:17:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 114 [2025-03-03 14:17:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:06,923 INFO L225 Difference]: With dead ends: 8933 [2025-03-03 14:17:06,923 INFO L226 Difference]: Without dead ends: 6197 [2025-03-03 14:17:06,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 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:17:06,936 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 2838 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 4651 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 2532 SdHoareTripleChecker+Invalid, 5392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 4651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:06,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 2532 Invalid, 5392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 4651 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:17:06,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6197 states. [2025-03-03 14:17:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6197 to 5962. [2025-03-03 14:17:07,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5962 states, 4488 states have (on average 1.6122994652406417) internal successors, (7236), 4669 states have internal predecessors, (7236), 1204 states have call successors, (1204), 237 states have call predecessors, (1204), 269 states have return successors, (1389), 1132 states have call predecessors, (1389), 1199 states have call successors, (1389) [2025-03-03 14:17:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5962 states to 5962 states and 9829 transitions. [2025-03-03 14:17:07,196 INFO L78 Accepts]: Start accepts. Automaton has 5962 states and 9829 transitions. Word has length 114 [2025-03-03 14:17:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:07,196 INFO L471 AbstractCegarLoop]: Abstraction has 5962 states and 9829 transitions. [2025-03-03 14:17:07,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 5 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:17:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 5962 states and 9829 transitions. [2025-03-03 14:17:07,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:17:07,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:07,199 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, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:07,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:17:07,199 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:07,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:07,200 INFO L85 PathProgramCache]: Analyzing trace with hash -806421400, now seen corresponding path program 1 times [2025-03-03 14:17:07,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:07,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021694453] [2025-03-03 14:17:07,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:07,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:17:07,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:17:07,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:07,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:07,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:07,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021694453] [2025-03-03 14:17:07,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021694453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:07,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:07,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:07,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951283611] [2025-03-03 14:17:07,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:07,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:07,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:07,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:07,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:07,341 INFO L87 Difference]: Start difference. First operand 5962 states and 9829 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:17:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:09,691 INFO L93 Difference]: Finished difference Result 17523 states and 29501 transitions. [2025-03-03 14:17:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:09,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 116 [2025-03-03 14:17:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:09,747 INFO L225 Difference]: With dead ends: 17523 [2025-03-03 14:17:09,748 INFO L226 Difference]: Without dead ends: 11602 [2025-03-03 14:17:09,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:09,771 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 3465 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 1070 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3501 SdHoareTripleChecker+Valid, 2218 SdHoareTripleChecker+Invalid, 4540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1070 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:09,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3501 Valid, 2218 Invalid, 4540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1070 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:17:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11602 states. [2025-03-03 14:17:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11602 to 10107. [2025-03-03 14:17:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10107 states, 7317 states have (on average 1.5957359573595735) internal successors, (11676), 7728 states have internal predecessors, (11676), 2357 states have call successors, (2357), 360 states have call predecessors, (2357), 432 states have return successors, (2779), 2291 states have call predecessors, (2779), 2352 states have call successors, (2779) [2025-03-03 14:17:10,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10107 states to 10107 states and 16812 transitions. [2025-03-03 14:17:10,269 INFO L78 Accepts]: Start accepts. Automaton has 10107 states and 16812 transitions. Word has length 116 [2025-03-03 14:17:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:10,271 INFO L471 AbstractCegarLoop]: Abstraction has 10107 states and 16812 transitions. [2025-03-03 14:17:10,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:17:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 10107 states and 16812 transitions. [2025-03-03 14:17:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:17:10,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:10,273 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:10,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:17:10,274 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:10,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:10,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1708469891, now seen corresponding path program 1 times [2025-03-03 14:17:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940758704] [2025-03-03 14:17:10,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:10,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:10,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:17:10,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:17:10,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:10,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:10,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:10,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940758704] [2025-03-03 14:17:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940758704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:10,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:10,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:10,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757169221] [2025-03-03 14:17:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:10,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:10,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:10,412 INFO L87 Difference]: Start difference. First operand 10107 states and 16812 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:17:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:13,557 INFO L93 Difference]: Finished difference Result 34704 states and 59491 transitions. [2025-03-03 14:17:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:13,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 117 [2025-03-03 14:17:13,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:13,709 INFO L225 Difference]: With dead ends: 34704 [2025-03-03 14:17:13,709 INFO L226 Difference]: Without dead ends: 24645 [2025-03-03 14:17:13,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:13,754 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 3478 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 3441 mSolverCounterSat, 1089 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3515 SdHoareTripleChecker+Valid, 2231 SdHoareTripleChecker+Invalid, 4530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1089 IncrementalHoareTripleChecker+Valid, 3441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:13,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3515 Valid, 2231 Invalid, 4530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1089 Valid, 3441 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:17:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24645 states. [2025-03-03 14:17:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24645 to 21736. [2025-03-03 14:17:15,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21736 states, 14889 states have (on average 1.5779434481832224) internal successors, (23494), 15965 states have internal predecessors, (23494), 6018 states have call successors, (6018), 608 states have call predecessors, (6018), 828 states have return successors, (7366), 6030 states have call predecessors, (7366), 6013 states have call successors, (7366) [2025-03-03 14:17:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21736 states to 21736 states and 36878 transitions. [2025-03-03 14:17:15,334 INFO L78 Accepts]: Start accepts. Automaton has 21736 states and 36878 transitions. Word has length 117 [2025-03-03 14:17:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:15,334 INFO L471 AbstractCegarLoop]: Abstraction has 21736 states and 36878 transitions. [2025-03-03 14:17:15,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:17:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 21736 states and 36878 transitions. [2025-03-03 14:17:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:17:15,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:15,338 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:15,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:17:15,338 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:15,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:15,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1425933805, now seen corresponding path program 1 times [2025-03-03 14:17:15,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021678120] [2025-03-03 14:17:15,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:15,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:17:15,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:17:15,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:15,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:15,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:15,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021678120] [2025-03-03 14:17:15,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021678120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:15,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:15,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:15,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384727618] [2025-03-03 14:17:15,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:15,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:15,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:15,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:15,509 INFO L87 Difference]: Start difference. First operand 21736 states and 36878 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:17:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:17:21,264 INFO L93 Difference]: Finished difference Result 86679 states and 152116 transitions. [2025-03-03 14:17:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:17:21,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 118 [2025-03-03 14:17:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:17:21,884 INFO L225 Difference]: With dead ends: 86679 [2025-03-03 14:17:21,884 INFO L226 Difference]: Without dead ends: 64993 [2025-03-03 14:17:22,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:17:22,033 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 3490 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 3446 mSolverCounterSat, 1093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3528 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 4539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1093 IncrementalHoareTripleChecker+Valid, 3446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:17:22,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3528 Valid, 2252 Invalid, 4539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1093 Valid, 3446 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 14:17:22,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64993 states. [2025-03-03 14:17:25,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64993 to 57495. [2025-03-03 14:17:25,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57495 states, 37311 states have (on average 1.565516871700035) internal successors, (58411), 40444 states have internal predecessors, (58411), 18293 states have call successors, (18293), 1104 states have call predecessors, (18293), 1890 states have return successors, (23547), 18725 states have call predecessors, (23547), 18288 states have call successors, (23547) [2025-03-03 14:17:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57495 states to 57495 states and 100251 transitions. [2025-03-03 14:17:26,321 INFO L78 Accepts]: Start accepts. Automaton has 57495 states and 100251 transitions. Word has length 118 [2025-03-03 14:17:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:17:26,322 INFO L471 AbstractCegarLoop]: Abstraction has 57495 states and 100251 transitions. [2025-03-03 14:17:26,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-03 14:17:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 57495 states and 100251 transitions. [2025-03-03 14:17:26,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:17:26,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:17:26,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:17:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:17:26,326 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:17:26,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:17:26,326 INFO L85 PathProgramCache]: Analyzing trace with hash 841336418, now seen corresponding path program 1 times [2025-03-03 14:17:26,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:17:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417273874] [2025-03-03 14:17:26,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:17:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:17:26,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:17:26,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:17:26,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:17:26,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:17:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:17:26,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:17:26,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417273874] [2025-03-03 14:17:26,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417273874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:17:26,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:17:26,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:17:26,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348595132] [2025-03-03 14:17:26,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:17:26,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:17:26,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:17:26,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:17:26,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:17:26,486 INFO L87 Difference]: Start difference. First operand 57495 states and 100251 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 6 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13)