./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_product09.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:34:06,939 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:34:06,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:34:07,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:34:07,005 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:34:07,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:34:07,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:34:07,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:34:07,020 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:34:07,020 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:34:07,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:34:07,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:34:07,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:34:07,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:34:07,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:34:07,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:34:07,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:34:07,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:34:07,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:34:07,023 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 -> 4cb164e6307f0ddcae5850d7f4578967441d1456f6ed5a5be472ba090758b873 [2025-03-16 18:34:07,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:34:07,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:34:07,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:34:07,252 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:34:07,252 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:34:07,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-03-16 18:34:08,347 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3a57b5a/2a567cd75a08475580d0df51ea14b450/FLAG93c4507da [2025-03-16 18:34:08,608 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:34:08,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product09.cil.c [2025-03-16 18:34:08,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3a57b5a/2a567cd75a08475580d0df51ea14b450/FLAG93c4507da [2025-03-16 18:34:08,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3a57b5a/2a567cd75a08475580d0df51ea14b450 [2025-03-16 18:34:08,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:34:08,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:34:08,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:34:08,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:34:08,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:34:08,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:34:08" (1/1) ... [2025-03-16 18:34:08,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d2d9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:08, skipping insertion in model container [2025-03-16 18:34:08,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:34:08" (1/1) ... [2025-03-16 18:34:08,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:34:08,892 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_product09.cil.c[28842,28855] [2025-03-16 18:34:08,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:34:09,010 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:34:09,017 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-16 18:34:09,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [412] [2025-03-16 18:34:09,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [532] [2025-03-16 18:34:09,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [716] [2025-03-16 18:34:09,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1383] [2025-03-16 18:34:09,018 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1418] [2025-03-16 18:34:09,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1427] [2025-03-16 18:34:09,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2869] [2025-03-16 18:34:09,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3235] [2025-03-16 18:34:09,019 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3247] [2025-03-16 18:34:09,067 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_product09.cil.c[28842,28855] [2025-03-16 18:34:09,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:34:09,121 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:34:09,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09 WrapperNode [2025-03-16 18:34:09,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:34:09,123 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:34:09,123 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:34:09,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:34:09,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,171 INFO L138 Inliner]: procedures = 89, calls = 330, calls flagged for inlining = 25, calls inlined = 22, statements flattened = 808 [2025-03-16 18:34:09,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:34:09,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:34:09,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:34:09,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:34:09,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,211 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-16 18:34:09,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,222 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,242 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:34:09,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:34:09,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:34:09,243 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:34:09,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (1/1) ... [2025-03-16 18:34:09,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:34:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:34:09,272 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-16 18:34:09,274 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-16 18:34:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:34:09,291 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2025-03-16 18:34:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2025-03-16 18:34:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:34:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:34:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:34:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:34:09,292 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:34:09,292 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:34:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:34:09,293 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:34:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:34:09,293 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:34:09,293 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2025-03-16 18:34:09,293 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2025-03-16 18:34:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:34:09,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:34:09,294 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:34:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:34:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:34:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:34:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:34:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:34:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:34:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:34:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:34:09,295 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:34:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:34:09,296 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:34:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:34:09,296 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:34:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:34:09,296 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:34:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:34:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:34:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:34:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:34:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:34:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:34:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:34:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:34:09,298 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:34:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:34:09,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:34:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:34:09,300 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:34:09,421 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:34:09,422 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:34:09,473 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: #res := ~retValue_acc~4; [2025-03-16 18:34:09,475 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: #res := ~retValue_acc~10; [2025-03-16 18:34:09,752 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2190: #res := ~retValue_acc~18; [2025-03-16 18:34:09,802 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2294: #res := ~retValue_acc~21; [2025-03-16 18:34:09,811 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L490: #res := ~retValue_acc~3; [2025-03-16 18:34:09,865 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1745-1: isEmpty_#res#1 := isEmpty_~retValue_acc~15#1; [2025-03-16 18:34:09,903 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1825-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-03-16 18:34:09,903 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1838-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-03-16 18:34:10,020 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696-1: buttonForFloorIsPressed_#res#1 := buttonForFloorIsPressed_~retValue_acc~13#1; [2025-03-16 18:34:10,020 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2280-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-03-16 18:34:10,020 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-03-16 18:34:10,062 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: #res := ~retValue_acc~6; [2025-03-16 18:34:10,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L409-1: main_#res#1 := main_~retValue_acc~1#1; [2025-03-16 18:34:10,119 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1415-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2025-03-16 18:34:10,126 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L833: #res := ~retValue_acc~5; [2025-03-16 18:34:10,129 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1662: #res := ~retValue_acc~12; [2025-03-16 18:34:10,132 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1380: #res := ~retValue_acc~7; [2025-03-16 18:34:10,240 INFO L? ?]: Removed 421 outVars from TransFormulas that were not future-live. [2025-03-16 18:34:10,240 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:34:10,260 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:34:10,264 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:34:10,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:34:10 BoogieIcfgContainer [2025-03-16 18:34:10,265 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:34:10,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:34:10,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:34:10,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:34:10,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:34:08" (1/3) ... [2025-03-16 18:34:10,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775af802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:34:10, skipping insertion in model container [2025-03-16 18:34:10,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:34:09" (2/3) ... [2025-03-16 18:34:10,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775af802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:34:10, skipping insertion in model container [2025-03-16 18:34:10,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:34:10" (3/3) ... [2025-03-16 18:34:10,273 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2025-03-16 18:34:10,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:34:10,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec2_product09.cil.c that has 21 procedures, 518 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:34:10,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:34:10,343 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;@3e0955b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:34:10,344 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:34:10,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 410 states have (on average 1.7292682926829268) internal successors, (709), 431 states have internal predecessors, (709), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-16 18:34:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-16 18:34:10,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:10,367 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-16 18:34:10,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:10,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1514495420, now seen corresponding path program 1 times [2025-03-16 18:34:10,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:10,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892798357] [2025-03-16 18:34:10,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:10,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:10,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-16 18:34:10,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-16 18:34:10,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:10,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:10,824 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-16 18:34:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:10,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892798357] [2025-03-16 18:34:10,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892798357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648564927] [2025-03-16 18:34:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:10,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:10,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:10,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:10,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:10,848 INFO L87 Difference]: Start difference. First operand has 518 states, 410 states have (on average 1.7292682926829268) internal successors, (709), 431 states have internal predecessors, (709), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:10,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:10,965 INFO L93 Difference]: Finished difference Result 1021 states and 1742 transitions. [2025-03-16 18:34:10,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:10,970 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 69 [2025-03-16 18:34:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:10,985 INFO L225 Difference]: With dead ends: 1021 [2025-03-16 18:34:10,985 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 18:34:10,989 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-16 18:34:10,991 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 5 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2579 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-16 18:34:10,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2579 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 18:34:11,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-16 18:34:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.7259259259259259) internal successors, (699), 424 states have internal predecessors, (699), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 866 transitions. [2025-03-16 18:34:11,057 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 866 transitions. Word has length 69 [2025-03-16 18:34:11,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:11,058 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 866 transitions. [2025-03-16 18:34:11,058 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 866 transitions. [2025-03-16 18:34:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 18:34:11,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:11,065 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-16 18:34:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:34:11,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1458787003, now seen corresponding path program 1 times [2025-03-16 18:34:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814925021] [2025-03-16 18:34:11,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:11,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 18:34:11,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 18:34:11,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:11,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:11,276 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-16 18:34:11,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:11,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814925021] [2025-03-16 18:34:11,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814925021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:11,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:11,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:11,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816450634] [2025-03-16 18:34:11,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:11,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:11,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:11,280 INFO L87 Difference]: Start difference. First operand 511 states and 866 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:11,335 INFO L93 Difference]: Finished difference Result 1009 states and 1714 transitions. [2025-03-16 18:34:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:11,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2025-03-16 18:34:11,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:11,342 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 18:34:11,342 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 18:34:11,344 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-16 18:34:11,346 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 4 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2561 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-16 18:34:11,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2561 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:11,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 18:34:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-16 18:34:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.7234567901234568) internal successors, (698), 424 states have internal predecessors, (698), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 865 transitions. [2025-03-16 18:34:11,384 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 865 transitions. Word has length 71 [2025-03-16 18:34:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 865 transitions. [2025-03-16 18:34:11,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 865 transitions. [2025-03-16 18:34:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 18:34:11,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:11,387 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-16 18:34:11,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:34:11,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:11,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1503583803, now seen corresponding path program 1 times [2025-03-16 18:34:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:11,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043484595] [2025-03-16 18:34:11,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:11,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 18:34:11,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 18:34:11,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:11,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:11,507 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-16 18:34:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043484595] [2025-03-16 18:34:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043484595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:11,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:11,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:11,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369988045] [2025-03-16 18:34:11,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:11,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:11,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:11,509 INFO L87 Difference]: Start difference. First operand 511 states and 865 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:11,574 INFO L93 Difference]: Finished difference Result 1009 states and 1713 transitions. [2025-03-16 18:34:11,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:11,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 72 [2025-03-16 18:34:11,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:11,579 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 18:34:11,579 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 18:34:11,581 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-16 18:34:11,583 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 3 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2561 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-16 18:34:11,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2561 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 18:34:11,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-16 18:34:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.7209876543209877) internal successors, (697), 424 states have internal predecessors, (697), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 864 transitions. [2025-03-16 18:34:11,605 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 864 transitions. Word has length 72 [2025-03-16 18:34:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:11,606 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 864 transitions. [2025-03-16 18:34:11,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,606 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 864 transitions. [2025-03-16 18:34:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 18:34:11,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:11,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:11,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:34:11,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:11,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1248377288, now seen corresponding path program 1 times [2025-03-16 18:34:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:11,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173483459] [2025-03-16 18:34:11,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:11,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 18:34:11,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 18:34:11,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:11,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:11,754 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-16 18:34:11,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:11,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173483459] [2025-03-16 18:34:11,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173483459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:11,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:11,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:11,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257732347] [2025-03-16 18:34:11,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:11,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:11,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:11,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:11,757 INFO L87 Difference]: Start difference. First operand 511 states and 864 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:11,800 INFO L93 Difference]: Finished difference Result 1009 states and 1712 transitions. [2025-03-16 18:34:11,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:11,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2025-03-16 18:34:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:11,804 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 18:34:11,804 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 18:34:11,806 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-16 18:34:11,807 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 2 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2561 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-16 18:34:11,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2561 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:11,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 18:34:11,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-16 18:34:11,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.7185185185185186) internal successors, (696), 424 states have internal predecessors, (696), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 863 transitions. [2025-03-16 18:34:11,840 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 863 transitions. Word has length 73 [2025-03-16 18:34:11,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:11,840 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 863 transitions. [2025-03-16 18:34:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 863 transitions. [2025-03-16 18:34:11,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 18:34:11,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:11,843 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-16 18:34:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:34:11,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash 505519784, now seen corresponding path program 1 times [2025-03-16 18:34:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361329423] [2025-03-16 18:34:11,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:11,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 18:34:11,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 18:34:11,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:11,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:11,965 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-16 18:34:11,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:11,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361329423] [2025-03-16 18:34:11,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361329423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:11,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:11,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:11,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551255704] [2025-03-16 18:34:11,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:11,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:11,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:11,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:11,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:11,968 INFO L87 Difference]: Start difference. First operand 511 states and 863 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:12,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:12,007 INFO L93 Difference]: Finished difference Result 1009 states and 1711 transitions. [2025-03-16 18:34:12,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2025-03-16 18:34:12,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:12,012 INFO L225 Difference]: With dead ends: 1009 [2025-03-16 18:34:12,012 INFO L226 Difference]: Without dead ends: 511 [2025-03-16 18:34:12,014 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-16 18:34:12,015 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2561 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-16 18:34:12,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2561 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-16 18:34:12,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-03-16 18:34:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 405 states have (on average 1.7160493827160495) internal successors, (695), 424 states have internal predecessors, (695), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 862 transitions. [2025-03-16 18:34:12,038 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 862 transitions. Word has length 74 [2025-03-16 18:34:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:12,038 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 862 transitions. [2025-03-16 18:34:12,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:12,039 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 862 transitions. [2025-03-16 18:34:12,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 18:34:12,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:12,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:12,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:34:12,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:12,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1202531765, now seen corresponding path program 1 times [2025-03-16 18:34:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645579283] [2025-03-16 18:34:12,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:12,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 18:34:12,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 18:34:12,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:12,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:12,267 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-16 18:34:12,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:12,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645579283] [2025-03-16 18:34:12,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645579283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:12,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:12,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:34:12,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494179686] [2025-03-16 18:34:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:12,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:34:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:12,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:34:12,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:12,270 INFO L87 Difference]: Start difference. First operand 511 states and 862 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:12,387 INFO L93 Difference]: Finished difference Result 975 states and 1643 transitions. [2025-03-16 18:34:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:34:12,388 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2025-03-16 18:34:12,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:12,391 INFO L225 Difference]: With dead ends: 975 [2025-03-16 18:34:12,391 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 18:34:12,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:12,395 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 91 mSDsluCounter, 5867 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 6717 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:12,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 6717 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 18:34:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 524. [2025-03-16 18:34:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 415 states have (on average 1.7108433734939759) internal successors, (710), 436 states have internal predecessors, (710), 87 states have call successors, (87), 20 states have call predecessors, (87), 21 states have return successors, (84), 80 states have call predecessors, (84), 82 states have call successors, (84) [2025-03-16 18:34:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 881 transitions. [2025-03-16 18:34:12,420 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 881 transitions. Word has length 75 [2025-03-16 18:34:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:12,420 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 881 transitions. [2025-03-16 18:34:12,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 881 transitions. [2025-03-16 18:34:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 18:34:12,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:12,425 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:12,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:34:12,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:12,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1411230068, now seen corresponding path program 1 times [2025-03-16 18:34:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946177435] [2025-03-16 18:34:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:12,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 18:34:12,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 18:34:12,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:12,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:12,497 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-16 18:34:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946177435] [2025-03-16 18:34:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946177435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:12,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694833759] [2025-03-16 18:34:12,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:12,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:12,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:12,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:12,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:12,500 INFO L87 Difference]: Start difference. First operand 524 states and 881 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:12,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:12,536 INFO L93 Difference]: Finished difference Result 1027 states and 1737 transitions. [2025-03-16 18:34:12,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:34:12,536 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-03-16 18:34:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:12,539 INFO L225 Difference]: With dead ends: 1027 [2025-03-16 18:34:12,539 INFO L226 Difference]: Without dead ends: 505 [2025-03-16 18:34:12,545 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-16 18:34:12,546 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 0 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2563 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-16 18:34:12,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2563 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-16 18:34:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-16 18:34:12,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 399 states have (on average 1.7067669172932332) internal successors, (681), 418 states have internal predecessors, (681), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 848 transitions. [2025-03-16 18:34:12,563 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 848 transitions. Word has length 75 [2025-03-16 18:34:12,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:12,563 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 848 transitions. [2025-03-16 18:34:12,563 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, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:12,564 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 848 transitions. [2025-03-16 18:34:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 18:34:12,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:12,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:12,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:34:12,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:12,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:12,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1106341343, now seen corresponding path program 1 times [2025-03-16 18:34:12,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:12,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29694770] [2025-03-16 18:34:12,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:12,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:12,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 18:34:12,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 18:34:12,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:12,669 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-16 18:34:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29694770] [2025-03-16 18:34:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29694770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155748521] [2025-03-16 18:34:12,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:12,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:12,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:12,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:12,671 INFO L87 Difference]: Start difference. First operand 505 states and 848 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:12,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:12,820 INFO L93 Difference]: Finished difference Result 972 states and 1635 transitions. [2025-03-16 18:34:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:12,820 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2025-03-16 18:34:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:12,823 INFO L225 Difference]: With dead ends: 972 [2025-03-16 18:34:12,823 INFO L226 Difference]: Without dead ends: 514 [2025-03-16 18:34:12,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:12,825 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 55 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 3996 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-16 18:34:12,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 3996 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-16 18:34:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 505. [2025-03-16 18:34:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 399 states have (on average 1.6967418546365916) internal successors, (677), 418 states have internal predecessors, (677), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 844 transitions. [2025-03-16 18:34:12,843 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 844 transitions. Word has length 76 [2025-03-16 18:34:12,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:12,843 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 844 transitions. [2025-03-16 18:34:12,844 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), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 844 transitions. [2025-03-16 18:34:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 18:34:12,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:12,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:12,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:34:12,846 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:12,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash -783935084, now seen corresponding path program 1 times [2025-03-16 18:34:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990024534] [2025-03-16 18:34:12,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:12,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:12,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 18:34:12,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 18:34:12,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:12,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:12,942 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-16 18:34:12,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:12,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990024534] [2025-03-16 18:34:12,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990024534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:12,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:12,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280532464] [2025-03-16 18:34:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:12,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:12,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:12,943 INFO L87 Difference]: Start difference. First operand 505 states and 844 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:13,071 INFO L93 Difference]: Finished difference Result 972 states and 1631 transitions. [2025-03-16 18:34:13,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:13,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2025-03-16 18:34:13,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:13,075 INFO L225 Difference]: With dead ends: 972 [2025-03-16 18:34:13,075 INFO L226 Difference]: Without dead ends: 514 [2025-03-16 18:34:13,077 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-16 18:34:13,077 INFO L435 NwaCegarLoop]: 804 mSDtfsCounter, 54 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 3978 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-16 18:34:13,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 3978 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:13,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-16 18:34:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 505. [2025-03-16 18:34:13,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 399 states have (on average 1.68671679197995) internal successors, (673), 418 states have internal predecessors, (673), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:13,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 840 transitions. [2025-03-16 18:34:13,092 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 840 transitions. Word has length 77 [2025-03-16 18:34:13,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:13,092 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 840 transitions. [2025-03-16 18:34:13,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,092 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 840 transitions. [2025-03-16 18:34:13,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 18:34:13,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:13,094 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:13,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:34:13,094 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:13,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1213727055, now seen corresponding path program 1 times [2025-03-16 18:34:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990725504] [2025-03-16 18:34:13,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:13,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 18:34:13,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 18:34:13,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:13,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:13,199 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-16 18:34:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990725504] [2025-03-16 18:34:13,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990725504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:13,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:13,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:13,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365630160] [2025-03-16 18:34:13,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:13,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:13,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:13,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:13,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:13,201 INFO L87 Difference]: Start difference. First operand 505 states and 840 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:13,256 INFO L93 Difference]: Finished difference Result 963 states and 1613 transitions. [2025-03-16 18:34:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:34:13,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 78 [2025-03-16 18:34:13,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:13,260 INFO L225 Difference]: With dead ends: 963 [2025-03-16 18:34:13,260 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 18:34:13,262 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-16 18:34:13,262 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 91 mSDsluCounter, 4065 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 4894 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-16 18:34:13,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 4894 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 18:34:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-16 18:34:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 378 states have (on average 1.6825396825396826) internal successors, (636), 397 states have internal predecessors, (636), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 803 transitions. [2025-03-16 18:34:13,278 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 803 transitions. Word has length 78 [2025-03-16 18:34:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:13,278 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 803 transitions. [2025-03-16 18:34:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 803 transitions. [2025-03-16 18:34:13,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 18:34:13,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:13,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:34:13,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash -619855522, now seen corresponding path program 1 times [2025-03-16 18:34:13,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:13,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88306167] [2025-03-16 18:34:13,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:13,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:13,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 18:34:13,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 18:34:13,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:13,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:13,380 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-16 18:34:13,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:13,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88306167] [2025-03-16 18:34:13,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88306167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:13,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:13,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:13,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029633171] [2025-03-16 18:34:13,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:13,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:13,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:13,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:13,382 INFO L87 Difference]: Start difference. First operand 484 states and 803 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:13,445 INFO L93 Difference]: Finished difference Result 942 states and 1576 transitions. [2025-03-16 18:34:13,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:13,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2025-03-16 18:34:13,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:13,450 INFO L225 Difference]: With dead ends: 942 [2025-03-16 18:34:13,450 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 18:34:13,452 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-16 18:34:13,452 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 18 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 3916 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:13,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 3916 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 18:34:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-16 18:34:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 378 states have (on average 1.67989417989418) internal successors, (635), 397 states have internal predecessors, (635), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:13,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 802 transitions. [2025-03-16 18:34:13,470 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 802 transitions. Word has length 78 [2025-03-16 18:34:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:13,470 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 802 transitions. [2025-03-16 18:34:13,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,470 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 802 transitions. [2025-03-16 18:34:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 18:34:13,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:13,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:13,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 18:34:13,474 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:13,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:13,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1068936271, now seen corresponding path program 1 times [2025-03-16 18:34:13,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:13,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711139827] [2025-03-16 18:34:13,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:13,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 18:34:13,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 18:34:13,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:13,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:34:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711139827] [2025-03-16 18:34:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711139827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182944479] [2025-03-16 18:34:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:13,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:13,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:13,579 INFO L87 Difference]: Start difference. First operand 484 states and 802 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:13,638 INFO L93 Difference]: Finished difference Result 942 states and 1575 transitions. [2025-03-16 18:34:13,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:13,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2025-03-16 18:34:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:13,642 INFO L225 Difference]: With dead ends: 942 [2025-03-16 18:34:13,642 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 18:34:13,644 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-16 18:34:13,645 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 17 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3916 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-16 18:34:13,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3916 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:13,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 18:34:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-16 18:34:13,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 378 states have (on average 1.6772486772486772) internal successors, (634), 397 states have internal predecessors, (634), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 801 transitions. [2025-03-16 18:34:13,660 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 801 transitions. Word has length 79 [2025-03-16 18:34:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:13,660 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 801 transitions. [2025-03-16 18:34:13,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 801 transitions. [2025-03-16 18:34:13,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 18:34:13,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:13,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:13,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 18:34:13,663 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:13,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash 948849819, now seen corresponding path program 1 times [2025-03-16 18:34:13,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113136243] [2025-03-16 18:34:13,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:13,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:13,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 18:34:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 18:34:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:13,744 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-16 18:34:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:13,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113136243] [2025-03-16 18:34:13,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113136243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:13,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:13,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:13,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140805263] [2025-03-16 18:34:13,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:13,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:13,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:13,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:13,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:13,745 INFO L87 Difference]: Start difference. First operand 484 states and 801 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:13,796 INFO L93 Difference]: Finished difference Result 942 states and 1574 transitions. [2025-03-16 18:34:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:34:13,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2025-03-16 18:34:13,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:13,800 INFO L225 Difference]: With dead ends: 942 [2025-03-16 18:34:13,800 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 18:34:13,801 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-16 18:34:13,802 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 16 mSDsluCounter, 3131 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3916 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-16 18:34:13,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3916 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 18:34:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-16 18:34:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 378 states have (on average 1.6746031746031746) internal successors, (633), 397 states have internal predecessors, (633), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 800 transitions. [2025-03-16 18:34:13,814 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 800 transitions. Word has length 80 [2025-03-16 18:34:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:13,814 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 800 transitions. [2025-03-16 18:34:13,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-16 18:34:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 800 transitions. [2025-03-16 18:34:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 18:34:13,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:13,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:13,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:34:13,816 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2130096590, now seen corresponding path program 1 times [2025-03-16 18:34:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032755734] [2025-03-16 18:34:13,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:13,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 18:34:13,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 18:34:13,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:13,998 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-16 18:34:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032755734] [2025-03-16 18:34:13,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032755734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:13,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 18:34:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863141409] [2025-03-16 18:34:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:13,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 18:34:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:14,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 18:34:14,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:14,000 INFO L87 Difference]: Start difference. First operand 484 states and 800 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:14,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:14,083 INFO L93 Difference]: Finished difference Result 936 states and 1562 transitions. [2025-03-16 18:34:14,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 18:34:14,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2025-03-16 18:34:14,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:14,087 INFO L225 Difference]: With dead ends: 936 [2025-03-16 18:34:14,087 INFO L226 Difference]: Without dead ends: 484 [2025-03-16 18:34:14,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:34:14,089 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 6 mSDsluCounter, 6250 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 7034 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:14,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 7034 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-16 18:34:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2025-03-16 18:34:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 378 states have (on average 1.6719576719576719) internal successors, (632), 397 states have internal predecessors, (632), 86 states have call successors, (86), 20 states have call predecessors, (86), 19 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-16 18:34:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 799 transitions. [2025-03-16 18:34:14,102 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 799 transitions. Word has length 81 [2025-03-16 18:34:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:14,102 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 799 transitions. [2025-03-16 18:34:14,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 799 transitions. [2025-03-16 18:34:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 18:34:14,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:14,104 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:14,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 18:34:14,104 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1876176296, now seen corresponding path program 1 times [2025-03-16 18:34:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029511088] [2025-03-16 18:34:14,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:14,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 18:34:14,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 18:34:14,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:14,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:14,270 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-16 18:34:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:14,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029511088] [2025-03-16 18:34:14,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029511088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:14,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:14,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:34:14,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88572790] [2025-03-16 18:34:14,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:14,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:34:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:14,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:34:14,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:14,272 INFO L87 Difference]: Start difference. First operand 484 states and 799 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:15,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:15,563 INFO L93 Difference]: Finished difference Result 932 states and 1574 transitions. [2025-03-16 18:34:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:34:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 82 [2025-03-16 18:34:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:15,567 INFO L225 Difference]: With dead ends: 932 [2025-03-16 18:34:15,567 INFO L226 Difference]: Without dead ends: 488 [2025-03-16 18:34:15,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:34:15,569 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 1240 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:15,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 1554 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 18:34:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-16 18:34:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-16 18:34:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 381 states have (on average 1.6666666666666667) internal successors, (635), 400 states have internal predecessors, (635), 86 states have call successors, (86), 20 states have call predecessors, (86), 20 states have return successors, (97), 80 states have call predecessors, (97), 81 states have call successors, (97) [2025-03-16 18:34:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 818 transitions. [2025-03-16 18:34:15,592 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 818 transitions. Word has length 82 [2025-03-16 18:34:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:15,592 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 818 transitions. [2025-03-16 18:34:15,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 7 states have internal predecessors, (65), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-16 18:34:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 818 transitions. [2025-03-16 18:34:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 18:34:15,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:15,595 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:15,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 18:34:15,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash 80493631, now seen corresponding path program 1 times [2025-03-16 18:34:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718967941] [2025-03-16 18:34:15,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:15,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 18:34:15,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 18:34:15,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:15,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:15,702 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-16 18:34:15,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:15,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718967941] [2025-03-16 18:34:15,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718967941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:15,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:15,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:15,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741039722] [2025-03-16 18:34:15,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:15,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:15,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:15,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:15,704 INFO L87 Difference]: Start difference. First operand 488 states and 818 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:34:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:18,198 INFO L93 Difference]: Finished difference Result 1755 states and 3030 transitions. [2025-03-16 18:34:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:34:18,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2025-03-16 18:34:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:18,206 INFO L225 Difference]: With dead ends: 1755 [2025-03-16 18:34:18,206 INFO L226 Difference]: Without dead ends: 1307 [2025-03-16 18:34:18,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 18:34:18,210 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 2233 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 4463 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2300 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 5027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 4463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:18,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2300 Valid, 2545 Invalid, 5027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 4463 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 18:34:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2025-03-16 18:34:18,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1250. [2025-03-16 18:34:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 975 states have (on average 1.675897435897436) internal successors, (1634), 1023 states have internal predecessors, (1634), 223 states have call successors, (223), 51 states have call predecessors, (223), 51 states have return successors, (238), 212 states have call predecessors, (238), 218 states have call successors, (238) [2025-03-16 18:34:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 2095 transitions. [2025-03-16 18:34:18,269 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 2095 transitions. Word has length 83 [2025-03-16 18:34:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:18,269 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 2095 transitions. [2025-03-16 18:34:18,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:34:18,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 2095 transitions. [2025-03-16 18:34:18,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:34:18,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:18,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 18:34:18,272 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:18,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1546746254, now seen corresponding path program 1 times [2025-03-16 18:34:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813121595] [2025-03-16 18:34:18,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:18,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:34:18,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:34:18,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:18,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:18,378 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-16 18:34:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:18,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813121595] [2025-03-16 18:34:18,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813121595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:18,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:18,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:18,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317626364] [2025-03-16 18:34:18,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:18,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:18,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:18,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:18,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:18,380 INFO L87 Difference]: Start difference. First operand 1250 states and 2095 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:34:20,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:20,878 INFO L93 Difference]: Finished difference Result 5947 states and 10279 transitions. [2025-03-16 18:34:20,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:34:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2025-03-16 18:34:20,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:20,920 INFO L225 Difference]: With dead ends: 5947 [2025-03-16 18:34:20,920 INFO L226 Difference]: Without dead ends: 4737 [2025-03-16 18:34:20,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:34:20,926 INFO L435 NwaCegarLoop]: 794 mSDtfsCounter, 2997 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 5069 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3126 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 5069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:20,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3126 Valid, 2800 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 5069 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 18:34:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4737 states. [2025-03-16 18:34:21,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4737 to 4212. [2025-03-16 18:34:21,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4212 states, 3118 states have (on average 1.669980756895446) internal successors, (5207), 3330 states have internal predecessors, (5207), 940 states have call successors, (940), 137 states have call predecessors, (940), 153 states have return successors, (1134), 918 states have call predecessors, (1134), 935 states have call successors, (1134) [2025-03-16 18:34:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4212 states to 4212 states and 7281 transitions. [2025-03-16 18:34:21,113 INFO L78 Accepts]: Start accepts. Automaton has 4212 states and 7281 transitions. Word has length 85 [2025-03-16 18:34:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:21,113 INFO L471 AbstractCegarLoop]: Abstraction has 4212 states and 7281 transitions. [2025-03-16 18:34:21,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:34:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4212 states and 7281 transitions. [2025-03-16 18:34:21,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:34:21,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:21,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:21,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:34:21,116 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:21,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 517386956, now seen corresponding path program 1 times [2025-03-16 18:34:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:21,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154168326] [2025-03-16 18:34:21,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:21,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:34:21,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:34:21,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:21,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:21,252 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-16 18:34:21,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154168326] [2025-03-16 18:34:21,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154168326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:21,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:21,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:21,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893288195] [2025-03-16 18:34:21,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:21,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:21,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:21,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:21,254 INFO L87 Difference]: Start difference. First operand 4212 states and 7281 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:34:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:23,194 INFO L93 Difference]: Finished difference Result 11445 states and 19907 transitions. [2025-03-16 18:34:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 18:34:23,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2025-03-16 18:34:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:23,241 INFO L225 Difference]: With dead ends: 11445 [2025-03-16 18:34:23,241 INFO L226 Difference]: Without dead ends: 8377 [2025-03-16 18:34:23,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-16 18:34:23,258 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 2284 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:23,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 1668 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 18:34:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8377 states. [2025-03-16 18:34:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8377 to 7870. [2025-03-16 18:34:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7870 states, 5867 states have (on average 1.6672916311573207) internal successors, (9782), 6257 states have internal predecessors, (9782), 1690 states have call successors, (1690), 254 states have call predecessors, (1690), 312 states have return successors, (2163), 1649 states have call predecessors, (2163), 1685 states have call successors, (2163) [2025-03-16 18:34:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7870 states to 7870 states and 13635 transitions. [2025-03-16 18:34:23,655 INFO L78 Accepts]: Start accepts. Automaton has 7870 states and 13635 transitions. Word has length 85 [2025-03-16 18:34:23,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:23,656 INFO L471 AbstractCegarLoop]: Abstraction has 7870 states and 13635 transitions. [2025-03-16 18:34:23,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:34:23,656 INFO L276 IsEmpty]: Start isEmpty. Operand 7870 states and 13635 transitions. [2025-03-16 18:34:23,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 18:34:23,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:23,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:23,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:34:23,658 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:23,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:23,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1226917697, now seen corresponding path program 1 times [2025-03-16 18:34:23,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:23,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452353879] [2025-03-16 18:34:23,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:23,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:23,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:34:23,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:34:23,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:23,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:23,784 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-16 18:34:23,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:23,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452353879] [2025-03-16 18:34:23,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452353879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:23,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:23,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:34:23,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564290998] [2025-03-16 18:34:23,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:23,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:34:23,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:23,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:34:23,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:34:23,786 INFO L87 Difference]: Start difference. First operand 7870 states and 13635 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-16 18:34:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:24,105 INFO L93 Difference]: Finished difference Result 14518 states and 25215 transitions. [2025-03-16 18:34:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:24,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 90 [2025-03-16 18:34:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:24,157 INFO L225 Difference]: With dead ends: 14518 [2025-03-16 18:34:24,157 INFO L226 Difference]: Without dead ends: 7957 [2025-03-16 18:34:24,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:34:24,184 INFO L435 NwaCegarLoop]: 797 mSDtfsCounter, 0 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3158 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:24,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3158 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2025-03-16 18:34:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7943. [2025-03-16 18:34:24,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7943 states, 5923 states have (on average 1.6604761100793517) internal successors, (9835), 6312 states have internal predecessors, (9835), 1687 states have call successors, (1687), 254 states have call predecessors, (1687), 332 states have return successors, (2226), 1667 states have call predecessors, (2226), 1682 states have call successors, (2226) [2025-03-16 18:34:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7943 states to 7943 states and 13748 transitions. [2025-03-16 18:34:24,516 INFO L78 Accepts]: Start accepts. Automaton has 7943 states and 13748 transitions. Word has length 90 [2025-03-16 18:34:24,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:24,516 INFO L471 AbstractCegarLoop]: Abstraction has 7943 states and 13748 transitions. [2025-03-16 18:34:24,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-16 18:34:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 13748 transitions. [2025-03-16 18:34:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 18:34:24,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:24,519 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:34:24,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:34:24,519 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:24,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:24,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1077770299, now seen corresponding path program 1 times [2025-03-16 18:34:24,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:24,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158532535] [2025-03-16 18:34:24,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:24,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 18:34:24,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 18:34:24,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:24,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:24,660 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-16 18:34:24,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:24,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158532535] [2025-03-16 18:34:24,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158532535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:24,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:24,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:24,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391383009] [2025-03-16 18:34:24,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:24,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:24,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:24,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:24,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:24,662 INFO L87 Difference]: Start difference. First operand 7943 states and 13748 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 18:34:25,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:25,061 INFO L93 Difference]: Finished difference Result 15744 states and 27688 transitions. [2025-03-16 18:34:25,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:34:25,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 97 [2025-03-16 18:34:25,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:25,107 INFO L225 Difference]: With dead ends: 15744 [2025-03-16 18:34:25,107 INFO L226 Difference]: Without dead ends: 8091 [2025-03-16 18:34:25,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:25,139 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 225 mSDsluCounter, 3103 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:25,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3942 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:34:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2025-03-16 18:34:25,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 7967. [2025-03-16 18:34:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7967 states, 5944 states have (on average 1.6379542395693136) internal successors, (9736), 6336 states have internal predecessors, (9736), 1687 states have call successors, (1687), 254 states have call predecessors, (1687), 335 states have return successors, (2238), 1667 states have call predecessors, (2238), 1682 states have call successors, (2238) [2025-03-16 18:34:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7967 states to 7967 states and 13661 transitions. [2025-03-16 18:34:25,636 INFO L78 Accepts]: Start accepts. Automaton has 7967 states and 13661 transitions. Word has length 97 [2025-03-16 18:34:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:25,636 INFO L471 AbstractCegarLoop]: Abstraction has 7967 states and 13661 transitions. [2025-03-16 18:34:25,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-16 18:34:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 7967 states and 13661 transitions. [2025-03-16 18:34:25,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-16 18:34:25,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:25,639 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] [2025-03-16 18:34:25,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:34:25,640 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:25,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:25,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1937775031, now seen corresponding path program 1 times [2025-03-16 18:34:25,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:25,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823893993] [2025-03-16 18:34:25,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:25,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:25,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-16 18:34:25,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-16 18:34:25,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:25,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:34:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823893993] [2025-03-16 18:34:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823893993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:25,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:25,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401058820] [2025-03-16 18:34:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:25,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:25,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:25,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:25,793 INFO L87 Difference]: Start difference. First operand 7967 states and 13661 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:27,499 INFO L93 Difference]: Finished difference Result 15347 states and 26353 transitions. [2025-03-16 18:34:27,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:34:27,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) Word has length 102 [2025-03-16 18:34:27,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:27,545 INFO L225 Difference]: With dead ends: 15347 [2025-03-16 18:34:27,545 INFO L226 Difference]: Without dead ends: 8705 [2025-03-16 18:34:27,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:34:27,575 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 2008 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 2927 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2082 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 2927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:27,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2082 Valid, 1600 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 2927 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 18:34:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8705 states. [2025-03-16 18:34:27,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8705 to 8202. [2025-03-16 18:34:27,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8202 states, 6119 states have (on average 1.6268998202320641) internal successors, (9955), 6529 states have internal predecessors, (9955), 1707 states have call successors, (1707), 279 states have call predecessors, (1707), 375 states have return successors, (2330), 1685 states have call predecessors, (2330), 1702 states have call successors, (2330) [2025-03-16 18:34:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 13992 transitions. [2025-03-16 18:34:27,924 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 13992 transitions. Word has length 102 [2025-03-16 18:34:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:27,924 INFO L471 AbstractCegarLoop]: Abstraction has 8202 states and 13992 transitions. [2025-03-16 18:34:27,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 4 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 5 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:34:27,924 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 13992 transitions. [2025-03-16 18:34:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:34:27,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:27,926 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:27,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:34:27,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:27,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2076947904, now seen corresponding path program 1 times [2025-03-16 18:34:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:27,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742375939] [2025-03-16 18:34:27,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:27,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:27,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:34:27,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:34:27,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:27,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:34:28,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:28,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742375939] [2025-03-16 18:34:28,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742375939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:28,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:28,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:34:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432858627] [2025-03-16 18:34:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:28,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:34:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:28,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:34:28,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:34:28,034 INFO L87 Difference]: Start difference. First operand 8202 states and 13992 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:34:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:28,453 INFO L93 Difference]: Finished difference Result 8325 states and 14209 transitions. [2025-03-16 18:34:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2025-03-16 18:34:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:28,503 INFO L225 Difference]: With dead ends: 8325 [2025-03-16 18:34:28,503 INFO L226 Difference]: Without dead ends: 8310 [2025-03-16 18:34:28,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:28,513 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 862 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:28,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2213 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:34:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8310 states. [2025-03-16 18:34:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8310 to 8210. [2025-03-16 18:34:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8210 states, 6127 states have (on average 1.6260812795821773) internal successors, (9963), 6537 states have internal predecessors, (9963), 1707 states have call successors, (1707), 279 states have call predecessors, (1707), 375 states have return successors, (2330), 1685 states have call predecessors, (2330), 1702 states have call successors, (2330) [2025-03-16 18:34:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8210 states to 8210 states and 14000 transitions. [2025-03-16 18:34:28,847 INFO L78 Accepts]: Start accepts. Automaton has 8210 states and 14000 transitions. Word has length 107 [2025-03-16 18:34:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:28,847 INFO L471 AbstractCegarLoop]: Abstraction has 8210 states and 14000 transitions. [2025-03-16 18:34:28,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-16 18:34:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 8210 states and 14000 transitions. [2025-03-16 18:34:28,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 18:34:28,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:28,850 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:28,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 18:34:28,851 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:28,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:28,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2038563490, now seen corresponding path program 1 times [2025-03-16 18:34:28,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:28,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055750100] [2025-03-16 18:34:28,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:28,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:28,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 18:34:28,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 18:34:28,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:28,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:28,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 18:34:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:28,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055750100] [2025-03-16 18:34:28,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055750100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:28,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:28,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:34:28,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392919332] [2025-03-16 18:34:28,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:28,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:34:28,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:28,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:34:28,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:28,971 INFO L87 Difference]: Start difference. First operand 8210 states and 14000 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 18:34:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:29,310 INFO L93 Difference]: Finished difference Result 8225 states and 14018 transitions. [2025-03-16 18:34:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:34:29,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2025-03-16 18:34:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:29,356 INFO L225 Difference]: With dead ends: 8225 [2025-03-16 18:34:29,356 INFO L226 Difference]: Without dead ends: 8210 [2025-03-16 18:34:29,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:34:29,364 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 0 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4698 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-16 18:34:29,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4698 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:34:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8210 states. [2025-03-16 18:34:29,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8210 to 8210. [2025-03-16 18:34:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8210 states, 6127 states have (on average 1.6251020075077525) internal successors, (9957), 6537 states have internal predecessors, (9957), 1707 states have call successors, (1707), 279 states have call predecessors, (1707), 375 states have return successors, (2330), 1685 states have call predecessors, (2330), 1702 states have call successors, (2330) [2025-03-16 18:34:29,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8210 states to 8210 states and 13994 transitions. [2025-03-16 18:34:29,891 INFO L78 Accepts]: Start accepts. Automaton has 8210 states and 13994 transitions. Word has length 113 [2025-03-16 18:34:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 8210 states and 13994 transitions. [2025-03-16 18:34:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 6 states have internal predecessors, (84), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-16 18:34:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8210 states and 13994 transitions. [2025-03-16 18:34:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-16 18:34:29,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:29,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 18:34:29,895 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:29,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:29,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1928525584, now seen corresponding path program 1 times [2025-03-16 18:34:29,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:29,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799549228] [2025-03-16 18:34:29,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:29,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:29,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-16 18:34:29,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-16 18:34:29,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:29,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:34:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799549228] [2025-03-16 18:34:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799549228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 18:34:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016649763] [2025-03-16 18:34:30,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:30,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:34:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:30,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:34:30,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:34:30,095 INFO L87 Difference]: Start difference. First operand 8210 states and 13994 transitions. Second operand has 9 states, 8 states have (on average 11.125) internal successors, (89), 9 states have internal predecessors, (89), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-16 18:34:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:32,379 INFO L93 Difference]: Finished difference Result 17575 states and 29670 transitions. [2025-03-16 18:34:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 18:34:32,379 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.125) internal successors, (89), 9 states have internal predecessors, (89), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-03-16 18:34:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:32,428 INFO L225 Difference]: With dead ends: 17575 [2025-03-16 18:34:32,429 INFO L226 Difference]: Without dead ends: 10513 [2025-03-16 18:34:32,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-16 18:34:32,458 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 2032 mSDsluCounter, 2328 mSDsCounter, 0 mSdLazyCounter, 5245 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2798 SdHoareTripleChecker+Invalid, 5667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 5245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:32,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 2798 Invalid, 5667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 5245 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 18:34:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10513 states. [2025-03-16 18:34:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10513 to 9684. [2025-03-16 18:34:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9684 states, 7293 states have (on average 1.6009872480460716) internal successors, (11676), 7762 states have internal predecessors, (11676), 1890 states have call successors, (1890), 366 states have call predecessors, (1890), 500 states have return successors, (2603), 1847 states have call predecessors, (2603), 1885 states have call successors, (2603) [2025-03-16 18:34:32,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 16169 transitions. [2025-03-16 18:34:32,838 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 16169 transitions. Word has length 125 [2025-03-16 18:34:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:32,839 INFO L471 AbstractCegarLoop]: Abstraction has 9684 states and 16169 transitions. [2025-03-16 18:34:32,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.125) internal successors, (89), 9 states have internal predecessors, (89), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-16 18:34:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 16169 transitions. [2025-03-16 18:34:32,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 18:34:32,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:32,842 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:32,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 18:34:32,842 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:32,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:32,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1334527264, now seen corresponding path program 1 times [2025-03-16 18:34:32,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:32,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253108647] [2025-03-16 18:34:32,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:32,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:32,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 18:34:32,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 18:34:32,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:32,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:33,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:34:33,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:33,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253108647] [2025-03-16 18:34:33,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253108647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:33,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:33,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 18:34:33,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310167992] [2025-03-16 18:34:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:33,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:34:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:33,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:34:33,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:34:33,078 INFO L87 Difference]: Start difference. First operand 9684 states and 16169 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:34:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:34,265 INFO L93 Difference]: Finished difference Result 19374 states and 32486 transitions. [2025-03-16 18:34:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:34:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 123 [2025-03-16 18:34:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:34,314 INFO L225 Difference]: With dead ends: 19374 [2025-03-16 18:34:34,315 INFO L226 Difference]: Without dead ends: 9742 [2025-03-16 18:34:34,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:34:34,344 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 1188 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:34,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 1545 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 18:34:34,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9742 states. [2025-03-16 18:34:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9742 to 9684. [2025-03-16 18:34:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9684 states, 7293 states have (on average 1.600164541341012) internal successors, (11670), 7762 states have internal predecessors, (11670), 1890 states have call successors, (1890), 366 states have call predecessors, (1890), 500 states have return successors, (2603), 1847 states have call predecessors, (2603), 1885 states have call successors, (2603) [2025-03-16 18:34:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9684 states to 9684 states and 16163 transitions. [2025-03-16 18:34:34,775 INFO L78 Accepts]: Start accepts. Automaton has 9684 states and 16163 transitions. Word has length 123 [2025-03-16 18:34:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:34,775 INFO L471 AbstractCegarLoop]: Abstraction has 9684 states and 16163 transitions. [2025-03-16 18:34:34,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 4 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:34:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 9684 states and 16163 transitions. [2025-03-16 18:34:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-16 18:34:34,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:34,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:34,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 18:34:34,779 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:34,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1163619270, now seen corresponding path program 1 times [2025-03-16 18:34:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453399061] [2025-03-16 18:34:34,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-16 18:34:34,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-16 18:34:34,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:34,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:34:34,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:34,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453399061] [2025-03-16 18:34:34,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453399061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:34,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:34,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:34,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537045636] [2025-03-16 18:34:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:34,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:34,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:34,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:34,872 INFO L87 Difference]: Start difference. First operand 9684 states and 16163 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:34:36,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:36,764 INFO L93 Difference]: Finished difference Result 31781 states and 54612 transitions. [2025-03-16 18:34:36,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:36,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-03-16 18:34:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:36,914 INFO L225 Difference]: With dead ends: 31781 [2025-03-16 18:34:36,914 INFO L226 Difference]: Without dead ends: 22137 [2025-03-16 18:34:36,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:34:36,965 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 1769 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1837 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:36,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1837 Valid, 909 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:34:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22137 states. [2025-03-16 18:34:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22137 to 21491. [2025-03-16 18:34:38,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21491 states, 15781 states have (on average 1.5947658576769532) internal successors, (25167), 16894 states have internal predecessors, (25167), 4667 states have call successors, (4667), 727 states have call predecessors, (4667), 1042 states have return successors, (7330), 4603 states have call predecessors, (7330), 4662 states have call successors, (7330) [2025-03-16 18:34:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21491 states to 21491 states and 37164 transitions. [2025-03-16 18:34:38,331 INFO L78 Accepts]: Start accepts. Automaton has 21491 states and 37164 transitions. Word has length 134 [2025-03-16 18:34:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:38,332 INFO L471 AbstractCegarLoop]: Abstraction has 21491 states and 37164 transitions. [2025-03-16 18:34:38,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:34:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 21491 states and 37164 transitions. [2025-03-16 18:34:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-16 18:34:38,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:38,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:38,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 18:34:38,336 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:38,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1544288786, now seen corresponding path program 1 times [2025-03-16 18:34:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:38,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330327251] [2025-03-16 18:34:38,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:38,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:38,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-16 18:34:38,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-16 18:34:38,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:38,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-16 18:34:38,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:38,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330327251] [2025-03-16 18:34:38,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330327251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:38,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:38,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:38,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704574711] [2025-03-16 18:34:38,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:38,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:38,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:38,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:38,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:38,425 INFO L87 Difference]: Start difference. First operand 21491 states and 37164 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:34:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:41,648 INFO L93 Difference]: Finished difference Result 71903 states and 129545 transitions. [2025-03-16 18:34:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2025-03-16 18:34:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:41,971 INFO L225 Difference]: With dead ends: 71903 [2025-03-16 18:34:41,971 INFO L226 Difference]: Without dead ends: 50452 [2025-03-16 18:34:42,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:34:42,056 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 1777 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:42,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 870 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 18:34:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50452 states. [2025-03-16 18:34:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50452 to 49026. [2025-03-16 18:34:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49026 states, 34989 states have (on average 1.5875560890565605) internal successors, (55547), 37683 states have internal predecessors, (55547), 11853 states have call successors, (11853), 1449 states have call predecessors, (11853), 2183 states have return successors, (21658), 11781 states have call predecessors, (21658), 11848 states have call successors, (21658) [2025-03-16 18:34:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49026 states to 49026 states and 89058 transitions. [2025-03-16 18:34:45,730 INFO L78 Accepts]: Start accepts. Automaton has 49026 states and 89058 transitions. Word has length 133 [2025-03-16 18:34:45,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:34:45,730 INFO L471 AbstractCegarLoop]: Abstraction has 49026 states and 89058 transitions. [2025-03-16 18:34:45,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:34:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 49026 states and 89058 transitions. [2025-03-16 18:34:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-16 18:34:45,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:34:45,735 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:34:45,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 18:34:45,735 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:34:45,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:34:45,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1551537644, now seen corresponding path program 1 times [2025-03-16 18:34:45,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:34:45,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140210759] [2025-03-16 18:34:45,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:34:45,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:34:45,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-16 18:34:45,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-16 18:34:45,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:34:45,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:34:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:34:45,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:34:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140210759] [2025-03-16 18:34:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140210759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:34:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:34:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:34:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919004953] [2025-03-16 18:34:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:34:45,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:34:45,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:34:45,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:34:45,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:34:45,832 INFO L87 Difference]: Start difference. First operand 49026 states and 89058 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:34:54,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:34:54,019 INFO L93 Difference]: Finished difference Result 166968 states and 320577 transitions. [2025-03-16 18:34:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:34:54,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 136 [2025-03-16 18:34:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:34:55,010 INFO L225 Difference]: With dead ends: 166968 [2025-03-16 18:34:55,010 INFO L226 Difference]: Without dead ends: 117982 [2025-03-16 18:34:55,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:34:55,278 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 1759 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:34:55,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1825 Valid, 867 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 18:34:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117982 states. [2025-03-16 18:35:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117982 to 115102. [2025-03-16 18:35:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115102 states, 79714 states have (on average 1.5789823619439496) internal successors, (125867), 86356 states have internal predecessors, (125867), 30784 states have call successors, (30784), 2893 states have call predecessors, (30784), 4603 states have return successors, (65971), 30798 states have call predecessors, (65971), 30779 states have call successors, (65971) [2025-03-16 18:35:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115102 states to 115102 states and 222622 transitions. [2025-03-16 18:35:03,480 INFO L78 Accepts]: Start accepts. Automaton has 115102 states and 222622 transitions. Word has length 136 [2025-03-16 18:35:03,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:35:03,481 INFO L471 AbstractCegarLoop]: Abstraction has 115102 states and 222622 transitions. [2025-03-16 18:35:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:35:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 115102 states and 222622 transitions. [2025-03-16 18:35:03,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-16 18:35:03,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:35:03,488 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:35:03,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 18:35:03,488 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:35:03,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:35:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash -853187783, now seen corresponding path program 1 times [2025-03-16 18:35:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:35:03,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044186198] [2025-03-16 18:35:03,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:35:03,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:35:03,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-16 18:35:03,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-16 18:35:03,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:35:03,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:35:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:35:03,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:35:03,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044186198] [2025-03-16 18:35:03,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044186198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:35:03,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:35:03,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:35:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331098026] [2025-03-16 18:35:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:35:03,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:35:03,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:35:03,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:35:03,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:35:03,953 INFO L87 Difference]: Start difference. First operand 115102 states and 222622 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 4 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)