./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_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_spec3_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 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:36:03,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:36:03,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:36:03,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:36:03,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:36:03,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:36:03,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:36:03,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:36:03,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:36:03,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:36:03,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:36:03,338 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:36:03,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:36:03,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:36:03,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:36:03,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:36:03,339 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:36:03,339 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:36:03,339 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:36:03,340 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:36:03,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:36:03,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:36:03,341 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:36:03,342 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:36:03,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:36:03,342 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 -> 67b10dcf95f436cfd8f02a55d7d1d272656f1382a4eb6ab4ad3bba992e95e024 [2025-03-16 18:36:03,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:36:03,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:36:03,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:36:03,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:36:03,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:36:03,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2025-03-16 18:36:04,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93ebf557/2650e57ff1c04cf1918d27f43f19b4b5/FLAG27717ac79 [2025-03-16 18:36:05,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:36:05,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c [2025-03-16 18:36:05,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93ebf557/2650e57ff1c04cf1918d27f43f19b4b5/FLAG27717ac79 [2025-03-16 18:36:05,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e93ebf557/2650e57ff1c04cf1918d27f43f19b4b5 [2025-03-16 18:36:05,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:36:05,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:36:05,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:36:05,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:36:05,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:36:05,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f794e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05, skipping insertion in model container [2025-03-16 18:36:05,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:36:05,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c[21710,21723] [2025-03-16 18:36:05,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:36:05,487 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:36:05,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [48] [2025-03-16 18:36:05,494 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [147] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [165] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [832] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [952] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [961] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2404] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2442] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2790] [2025-03-16 18:36:05,495 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2976] [2025-03-16 18:36:05,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product09.cil.c[21710,21723] [2025-03-16 18:36:05,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:36:05,604 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:36:05,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05 WrapperNode [2025-03-16 18:36:05,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:36:05,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:36:05,606 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:36:05,606 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:36:05,611 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:36:05" (1/1) ... [2025-03-16 18:36:05,629 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:36:05" (1/1) ... [2025-03-16 18:36:05,655 INFO L138 Inliner]: procedures = 87, calls = 336, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 804 [2025-03-16 18:36:05,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:36:05,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:36:05,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:36:05,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:36:05,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,691 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:36:05,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:36:05,731 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:36:05,731 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:36:05,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:36:05,732 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (1/1) ... [2025-03-16 18:36:05,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:36:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:05,758 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:36:05,761 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:36:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:36:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-03-16 18:36:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-03-16 18:36:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-03-16 18:36:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-03-16 18:36:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-03-16 18:36:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-03-16 18:36:05,781 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-03-16 18:36:05,781 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-03-16 18:36:05,782 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-16 18:36:05,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-03-16 18:36:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-03-16 18:36:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-03-16 18:36:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-03-16 18:36:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:36:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:36:05,783 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-03-16 18:36:05,783 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-03-16 18:36:05,930 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:36:05,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:36:05,964 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237: #res := ~retValue_acc~10; [2025-03-16 18:36:05,984 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L949: #res := ~retValue_acc~5; [2025-03-16 18:36:05,987 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1036: #res := ~retValue_acc~6; [2025-03-16 18:36:06,319 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722: #res := ~retValue_acc~14; [2025-03-16 18:36:06,395 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: #res := ~retValue_acc~17; [2025-03-16 18:36:06,407 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L910: #res := ~retValue_acc~4; [2025-03-16 18:36:06,430 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1228: #res := ~retValue_acc~9; [2025-03-16 18:36:06,491 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1277-1: isEmpty_#res#1 := isEmpty_~retValue_acc~11#1; [2025-03-16 18:36:06,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1357-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~12#1; [2025-03-16 18:36:06,541 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1370-1: isIdle_#res#1 := isIdle_~retValue_acc~13#1; [2025-03-16 18:36:06,688 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1812-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~16#1; [2025-03-16 18:36:06,689 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1185-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~7#1; [2025-03-16 18:36:06,745 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: #res := ~retValue_acc~1; [2025-03-16 18:36:06,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2439-1: valid_product_#res#1 := valid_product_~retValue_acc~20#1; [2025-03-16 18:36:06,800 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787-1: main_#res#1 := main_~retValue_acc~22#1; [2025-03-16 18:36:06,809 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: #res := ~retValue_acc~0; [2025-03-16 18:36:06,813 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: #res := ~retValue_acc~2; [2025-03-16 18:36:06,928 INFO L? ?]: Removed 429 outVars from TransFormulas that were not future-live. [2025-03-16 18:36:06,928 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:36:06,950 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:36:06,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:36:06,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:36:06 BoogieIcfgContainer [2025-03-16 18:36:06,953 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:36:06,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:36:06,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:36:06,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:36:06,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:36:05" (1/3) ... [2025-03-16 18:36:06,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42454a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:36:06, skipping insertion in model container [2025-03-16 18:36:06,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:36:05" (2/3) ... [2025-03-16 18:36:06,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42454a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:36:06, skipping insertion in model container [2025-03-16 18:36:06,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:36:06" (3/3) ... [2025-03-16 18:36:06,959 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product09.cil.c [2025-03-16 18:36:06,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:36:06,970 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product09.cil.c that has 24 procedures, 548 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 18:36:07,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:36:07,029 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;@87974b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:36:07,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:36:07,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 548 states, 425 states have (on average 1.703529411764706) internal successors, (724), 443 states have internal predecessors, (724), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-16 18:36:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 18:36:07,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:07,049 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] [2025-03-16 18:36:07,049 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:07,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1343385310, now seen corresponding path program 1 times [2025-03-16 18:36:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:07,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436624294] [2025-03-16 18:36:07,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:07,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 18:36:07,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 18:36:07,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:07,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:07,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:07,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:07,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436624294] [2025-03-16 18:36:07,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436624294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:07,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:07,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:36:07,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674915010] [2025-03-16 18:36:07,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:07,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:36:07,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:07,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:36:07,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:07,714 INFO L87 Difference]: Start difference. First operand has 548 states, 425 states have (on average 1.703529411764706) internal successors, (724), 443 states have internal predecessors, (724), 98 states have call successors, (98), 23 states have call predecessors, (98), 23 states have return successors, (98), 95 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:07,943 INFO L93 Difference]: Finished difference Result 1097 states and 1856 transitions. [2025-03-16 18:36:07,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:36:07,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2025-03-16 18:36:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:07,956 INFO L225 Difference]: With dead ends: 1097 [2025-03-16 18:36:07,956 INFO L226 Difference]: Without dead ends: 554 [2025-03-16 18:36:07,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 18:36:07,964 INFO L435 NwaCegarLoop]: 905 mSDtfsCounter, 91 mSDsluCounter, 4439 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:07,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:36:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-03-16 18:36:08,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2025-03-16 18:36:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 429 states have (on average 1.6946386946386947) internal successors, (727), 447 states have internal predecessors, (727), 99 states have call successors, (99), 23 states have call predecessors, (99), 23 states have return successors, (98), 94 states have call predecessors, (98), 96 states have call successors, (98) [2025-03-16 18:36:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 924 transitions. [2025-03-16 18:36:08,046 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 924 transitions. Word has length 81 [2025-03-16 18:36:08,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:08,047 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 924 transitions. [2025-03-16 18:36:08,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:08,047 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 924 transitions. [2025-03-16 18:36:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 18:36:08,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:08,052 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] [2025-03-16 18:36:08,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:36:08,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:08,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:08,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1458018663, now seen corresponding path program 1 times [2025-03-16 18:36:08,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:08,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642552885] [2025-03-16 18:36:08,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:08,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 18:36:08,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 18:36:08,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:08,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:08,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:08,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642552885] [2025-03-16 18:36:08,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642552885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:08,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375074282] [2025-03-16 18:36:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:08,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:08,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:08,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:08,203 INFO L87 Difference]: Start difference. First operand 552 states and 924 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:08,267 INFO L93 Difference]: Finished difference Result 1090 states and 1833 transitions. [2025-03-16 18:36:08,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:36:08,268 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2025-03-16 18:36:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:08,273 INFO L225 Difference]: With dead ends: 1090 [2025-03-16 18:36:08,273 INFO L226 Difference]: Without dead ends: 528 [2025-03-16 18:36:08,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:36:08,278 INFO L435 NwaCegarLoop]: 894 mSDtfsCounter, 14 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2677 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:08,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2677 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:08,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-16 18:36:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-16 18:36:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 408 states have (on average 1.6862745098039216) internal successors, (688), 424 states have internal predecessors, (688), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 881 transitions. [2025-03-16 18:36:08,343 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 881 transitions. Word has length 82 [2025-03-16 18:36:08,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:08,343 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 881 transitions. [2025-03-16 18:36:08,343 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, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:08,344 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 881 transitions. [2025-03-16 18:36:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 18:36:08,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:08,351 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] [2025-03-16 18:36:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:36:08,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:08,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:08,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1042969663, now seen corresponding path program 1 times [2025-03-16 18:36:08,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:08,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478485828] [2025-03-16 18:36:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:08,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 18:36:08,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 18:36:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:08,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:08,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478485828] [2025-03-16 18:36:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478485828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:08,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:36:08,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889676807] [2025-03-16 18:36:08,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:08,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:36:08,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:08,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:36:08,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:08,595 INFO L87 Difference]: Start difference. First operand 528 states and 881 transitions. Second operand has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:08,693 INFO L93 Difference]: Finished difference Result 1053 states and 1765 transitions. [2025-03-16 18:36:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:36:08,694 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2025-03-16 18:36:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:08,698 INFO L225 Difference]: With dead ends: 1053 [2025-03-16 18:36:08,698 INFO L226 Difference]: Without dead ends: 522 [2025-03-16 18:36:08,700 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:36:08,701 INFO L435 NwaCegarLoop]: 870 mSDtfsCounter, 77 mSDsluCounter, 4280 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5150 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:08,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5150 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-16 18:36:08,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2025-03-16 18:36:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 402 states have (on average 1.6791044776119404) internal successors, (675), 418 states have internal predecessors, (675), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 868 transitions. [2025-03-16 18:36:08,726 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 868 transitions. Word has length 82 [2025-03-16 18:36:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:08,727 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 868 transitions. [2025-03-16 18:36:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 868 transitions. [2025-03-16 18:36:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 18:36:08,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:08,730 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] [2025-03-16 18:36:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 18:36:08,731 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:08,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash -338006372, now seen corresponding path program 1 times [2025-03-16 18:36:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:08,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638863631] [2025-03-16 18:36:08,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 18:36:08,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 18:36:08,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:08,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:08,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:08,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638863631] [2025-03-16 18:36:08,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638863631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:08,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:08,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:36:08,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343734792] [2025-03-16 18:36:08,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:08,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:36:08,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:08,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:36:08,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:08,948 INFO L87 Difference]: Start difference. First operand 522 states and 868 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:09,023 INFO L93 Difference]: Finished difference Result 1041 states and 1739 transitions. [2025-03-16 18:36:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:36:09,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 83 [2025-03-16 18:36:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:09,029 INFO L225 Difference]: With dead ends: 1041 [2025-03-16 18:36:09,029 INFO L226 Difference]: Without dead ends: 516 [2025-03-16 18:36:09,032 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:36:09,032 INFO L435 NwaCegarLoop]: 858 mSDtfsCounter, 63 mSDsluCounter, 4232 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5090 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5090 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:09,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-16 18:36:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-16 18:36:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 396 states have (on average 1.6717171717171717) internal successors, (662), 412 states have internal predecessors, (662), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 855 transitions. [2025-03-16 18:36:09,058 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 855 transitions. Word has length 83 [2025-03-16 18:36:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:09,059 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 855 transitions. [2025-03-16 18:36:09,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 855 transitions. [2025-03-16 18:36:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 18:36:09,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:09,062 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] [2025-03-16 18:36:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 18:36:09,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:09,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1752840633, now seen corresponding path program 1 times [2025-03-16 18:36:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276219177] [2025-03-16 18:36:09,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:09,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 18:36:09,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 18:36:09,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:09,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:09,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:09,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276219177] [2025-03-16 18:36:09,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276219177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:09,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:09,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:36:09,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124244746] [2025-03-16 18:36:09,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:09,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:36:09,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:09,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:36:09,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:09,245 INFO L87 Difference]: Start difference. First operand 516 states and 855 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:09,317 INFO L93 Difference]: Finished difference Result 1029 states and 1713 transitions. [2025-03-16 18:36:09,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:36:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2025-03-16 18:36:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:09,321 INFO L225 Difference]: With dead ends: 1029 [2025-03-16 18:36:09,321 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 18:36:09,326 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:36:09,328 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 49 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5030 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:09,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5030 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:09,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 18:36:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-16 18:36:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 390 states have (on average 1.6641025641025642) internal successors, (649), 406 states have internal predecessors, (649), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 842 transitions. [2025-03-16 18:36:09,360 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 842 transitions. Word has length 84 [2025-03-16 18:36:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:09,361 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 842 transitions. [2025-03-16 18:36:09,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 842 transitions. [2025-03-16 18:36:09,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 18:36:09,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:09,366 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] [2025-03-16 18:36:09,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 18:36:09,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash 272565233, now seen corresponding path program 1 times [2025-03-16 18:36:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:09,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313946218] [2025-03-16 18:36:09,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:09,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:09,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 18:36:09,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 18:36:09,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:09,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313946218] [2025-03-16 18:36:09,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313946218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:09,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:09,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 18:36:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654177969] [2025-03-16 18:36:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 18:36:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:09,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 18:36:09,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:09,514 INFO L87 Difference]: Start difference. First operand 510 states and 842 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:09,568 INFO L93 Difference]: Finished difference Result 1017 states and 1687 transitions. [2025-03-16 18:36:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:36:09,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 84 [2025-03-16 18:36:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:09,572 INFO L225 Difference]: With dead ends: 1017 [2025-03-16 18:36:09,572 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 18:36:09,574 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:36:09,575 INFO L435 NwaCegarLoop]: 834 mSDtfsCounter, 24 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4982 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:09,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4982 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 18:36:09,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-16 18:36:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 390 states have (on average 1.6615384615384616) internal successors, (648), 406 states have internal predecessors, (648), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 841 transitions. [2025-03-16 18:36:09,594 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 841 transitions. Word has length 84 [2025-03-16 18:36:09,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:09,594 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 841 transitions. [2025-03-16 18:36:09,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:09,594 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 841 transitions. [2025-03-16 18:36:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 18:36:09,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:09,596 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] [2025-03-16 18:36:09,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 18:36:09,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:09,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash -198947818, now seen corresponding path program 1 times [2025-03-16 18:36:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:09,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130459200] [2025-03-16 18:36:09,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:09,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 18:36:09,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 18:36:09,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:09,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:09,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130459200] [2025-03-16 18:36:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130459200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:09,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451003951] [2025-03-16 18:36:09,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:09,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:09,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:09,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:09,687 INFO L87 Difference]: Start difference. First operand 510 states and 841 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:09,726 INFO L93 Difference]: Finished difference Result 1008 states and 1672 transitions. [2025-03-16 18:36:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:36:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 85 [2025-03-16 18:36:09,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:09,733 INFO L225 Difference]: With dead ends: 1008 [2025-03-16 18:36:09,733 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 18:36:09,735 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:36:09,736 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 15 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:09,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2463 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 18:36:09,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-16 18:36:09,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 390 states have (on average 1.658974358974359) internal successors, (647), 406 states have internal predecessors, (647), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 840 transitions. [2025-03-16 18:36:09,755 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 840 transitions. Word has length 85 [2025-03-16 18:36:09,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:09,755 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 840 transitions. [2025-03-16 18:36:09,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:09,756 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 840 transitions. [2025-03-16 18:36:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 18:36:09,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:09,757 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] [2025-03-16 18:36:09,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 18:36:09,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:09,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:09,758 INFO L85 PathProgramCache]: Analyzing trace with hash -121203487, now seen corresponding path program 1 times [2025-03-16 18:36:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901463114] [2025-03-16 18:36:09,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:09,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:09,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 18:36:09,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 18:36:09,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:09,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:09,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:09,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901463114] [2025-03-16 18:36:09,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901463114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:09,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:09,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:09,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852641469] [2025-03-16 18:36:09,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:09,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:09,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:09,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:09,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:09,846 INFO L87 Difference]: Start difference. First operand 510 states and 840 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:09,883 INFO L93 Difference]: Finished difference Result 1008 states and 1670 transitions. [2025-03-16 18:36:09,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:36:09,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2025-03-16 18:36:09,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:09,887 INFO L225 Difference]: With dead ends: 1008 [2025-03-16 18:36:09,887 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 18:36:09,889 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:36:09,890 INFO L435 NwaCegarLoop]: 827 mSDtfsCounter, 14 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:09,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2465 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 18:36:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-16 18:36:09,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 390 states have (on average 1.6564102564102565) internal successors, (646), 406 states have internal predecessors, (646), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 839 transitions. [2025-03-16 18:36:09,909 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 839 transitions. Word has length 86 [2025-03-16 18:36:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:09,910 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 839 transitions. [2025-03-16 18:36:09,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 839 transitions. [2025-03-16 18:36:09,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-16 18:36:09,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:09,912 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] [2025-03-16 18:36:09,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 18:36:09,912 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:09,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1809366983, now seen corresponding path program 1 times [2025-03-16 18:36:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:09,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084846230] [2025-03-16 18:36:09,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:09,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:09,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-16 18:36:09,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-16 18:36:09,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:09,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084846230] [2025-03-16 18:36:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084846230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:10,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:10,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475329528] [2025-03-16 18:36:10,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:10,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:10,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:10,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:10,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:10,017 INFO L87 Difference]: Start difference. First operand 510 states and 839 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:10,060 INFO L93 Difference]: Finished difference Result 1008 states and 1668 transitions. [2025-03-16 18:36:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:36:10,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2025-03-16 18:36:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:10,065 INFO L225 Difference]: With dead ends: 1008 [2025-03-16 18:36:10,066 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 18:36:10,069 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:36:10,071 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 13 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2467 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:36:10,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2467 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:10,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 18:36:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-16 18:36:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 390 states have (on average 1.6538461538461537) internal successors, (645), 406 states have internal predecessors, (645), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 838 transitions. [2025-03-16 18:36:10,089 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 838 transitions. Word has length 87 [2025-03-16 18:36:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:10,089 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 838 transitions. [2025-03-16 18:36:10,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 838 transitions. [2025-03-16 18:36:10,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-16 18:36:10,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:10,092 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] [2025-03-16 18:36:10,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 18:36:10,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:10,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1888869028, now seen corresponding path program 1 times [2025-03-16 18:36:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658331691] [2025-03-16 18:36:10,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:10,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-16 18:36:10,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-16 18:36:10,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:10,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:10,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:10,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:10,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658331691] [2025-03-16 18:36:10,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658331691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:10,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:10,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:10,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769623988] [2025-03-16 18:36:10,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:10,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:10,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:10,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:10,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:10,191 INFO L87 Difference]: Start difference. First operand 510 states and 838 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:10,227 INFO L93 Difference]: Finished difference Result 1008 states and 1666 transitions. [2025-03-16 18:36:10,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 18:36:10,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2025-03-16 18:36:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:10,231 INFO L225 Difference]: With dead ends: 1008 [2025-03-16 18:36:10,232 INFO L226 Difference]: Without dead ends: 510 [2025-03-16 18:36:10,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:10,234 INFO L435 NwaCegarLoop]: 829 mSDtfsCounter, 12 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2469 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:10,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2469 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:10,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2025-03-16 18:36:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2025-03-16 18:36:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 390 states have (on average 1.6512820512820512) internal successors, (644), 406 states have internal predecessors, (644), 98 states have call successors, (98), 23 states have call predecessors, (98), 21 states have return successors, (95), 93 states have call predecessors, (95), 95 states have call successors, (95) [2025-03-16 18:36:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 837 transitions. [2025-03-16 18:36:10,252 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 837 transitions. Word has length 88 [2025-03-16 18:36:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:10,253 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 837 transitions. [2025-03-16 18:36:10,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-16 18:36:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 837 transitions. [2025-03-16 18:36:10,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 18:36:10,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:10,256 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] [2025-03-16 18:36:10,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 18:36:10,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash 766797916, now seen corresponding path program 1 times [2025-03-16 18:36:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767720293] [2025-03-16 18:36:10,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:10,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:10,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:36:10,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:36:10,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:10,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:36:10,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767720293] [2025-03-16 18:36:10,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767720293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:36:10,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101299470] [2025-03-16 18:36:10,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:10,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:10,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:10,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:36:10,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:36:10,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 18:36:10,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 18:36:10,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:10,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:10,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:36:10,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:36:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:36:10,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:36:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101299470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:10,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:36:10,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-16 18:36:10,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87794240] [2025-03-16 18:36:10,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:10,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:36:10,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:10,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:36:10,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:36:10,828 INFO L87 Difference]: Start difference. First operand 510 states and 837 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:10,888 INFO L93 Difference]: Finished difference Result 1450 states and 2409 transitions. [2025-03-16 18:36:10,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:36:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 89 [2025-03-16 18:36:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:10,894 INFO L225 Difference]: With dead ends: 1450 [2025-03-16 18:36:10,894 INFO L226 Difference]: Without dead ends: 954 [2025-03-16 18:36:10,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:36:10,897 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 781 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:10,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1582 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-03-16 18:36:10,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 939. [2025-03-16 18:36:10,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 726 states have (on average 1.6639118457300275) internal successors, (1208), 757 states have internal predecessors, (1208), 172 states have call successors, (172), 41 states have call predecessors, (172), 40 states have return successors, (174), 166 states have call predecessors, (174), 169 states have call successors, (174) [2025-03-16 18:36:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1554 transitions. [2025-03-16 18:36:10,929 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1554 transitions. Word has length 89 [2025-03-16 18:36:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:10,929 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1554 transitions. [2025-03-16 18:36:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1554 transitions. [2025-03-16 18:36:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-16 18:36:10,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:10,932 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] [2025-03-16 18:36:10,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:36:11,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 18:36:11,137 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:11,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1533209238, now seen corresponding path program 1 times [2025-03-16 18:36:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192115027] [2025-03-16 18:36:11,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:11,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:36:11,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:36:11,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:36:11,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192115027] [2025-03-16 18:36:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192115027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:36:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091040795] [2025-03-16 18:36:11,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:11,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:11,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:11,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:36:11,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:36:11,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-16 18:36:11,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-16 18:36:11,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:11,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:11,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 18:36:11,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:36:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:36:11,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:36:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091040795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:36:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-16 18:36:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391206373] [2025-03-16 18:36:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:11,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:36:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:11,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:36:11,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:36:11,653 INFO L87 Difference]: Start difference. First operand 939 states and 1554 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:11,718 INFO L93 Difference]: Finished difference Result 2308 states and 3845 transitions. [2025-03-16 18:36:11,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:36:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 90 [2025-03-16 18:36:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:11,727 INFO L225 Difference]: With dead ends: 2308 [2025-03-16 18:36:11,727 INFO L226 Difference]: Without dead ends: 1383 [2025-03-16 18:36:11,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-16 18:36:11,733 INFO L435 NwaCegarLoop]: 898 mSDtfsCounter, 780 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:11,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1635 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2025-03-16 18:36:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1335. [2025-03-16 18:36:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1035 states have (on average 1.6772946859903382) internal successors, (1736), 1081 states have internal predecessors, (1736), 243 states have call successors, (243), 56 states have call predecessors, (243), 56 states have return successors, (250), 236 states have call predecessors, (250), 240 states have call successors, (250) [2025-03-16 18:36:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 2229 transitions. [2025-03-16 18:36:11,791 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 2229 transitions. Word has length 90 [2025-03-16 18:36:11,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:11,791 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 2229 transitions. [2025-03-16 18:36:11,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-16 18:36:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2229 transitions. [2025-03-16 18:36:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-16 18:36:11,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:11,795 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] [2025-03-16 18:36:11,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 18:36:11,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 18:36:11,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:11,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 975983997, now seen corresponding path program 1 times [2025-03-16 18:36:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:11,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389320100] [2025-03-16 18:36:11,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:12,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-16 18:36:12,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-16 18:36:12,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:12,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389320100] [2025-03-16 18:36:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389320100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:12,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:12,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:36:12,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995867250] [2025-03-16 18:36:12,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:12,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:36:12,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:12,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:36:12,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:36:12,137 INFO L87 Difference]: Start difference. First operand 1335 states and 2229 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:36:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:12,574 INFO L93 Difference]: Finished difference Result 3949 states and 6714 transitions. [2025-03-16 18:36:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:36:12,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2025-03-16 18:36:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:12,591 INFO L225 Difference]: With dead ends: 3949 [2025-03-16 18:36:12,592 INFO L226 Difference]: Without dead ends: 2628 [2025-03-16 18:36:12,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:36:12,601 INFO L435 NwaCegarLoop]: 936 mSDtfsCounter, 832 mSDsluCounter, 3378 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 4314 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:12,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 4314 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:36:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2628 states. [2025-03-16 18:36:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2628 to 2581. [2025-03-16 18:36:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2581 states, 2007 states have (on average 1.6806178375685101) internal successors, (3373), 2095 states have internal predecessors, (3373), 465 states have call successors, (465), 106 states have call predecessors, (465), 108 states have return successors, (559), 457 states have call predecessors, (559), 461 states have call successors, (559) [2025-03-16 18:36:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2581 states to 2581 states and 4397 transitions. [2025-03-16 18:36:12,705 INFO L78 Accepts]: Start accepts. Automaton has 2581 states and 4397 transitions. Word has length 92 [2025-03-16 18:36:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:12,705 INFO L471 AbstractCegarLoop]: Abstraction has 2581 states and 4397 transitions. [2025-03-16 18:36:12,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:36:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2581 states and 4397 transitions. [2025-03-16 18:36:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 18:36:12,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:12,726 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] [2025-03-16 18:36:12,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 18:36:12,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:12,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash -141159256, now seen corresponding path program 1 times [2025-03-16 18:36:12,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:12,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477606231] [2025-03-16 18:36:12,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:12,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:12,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:36:12,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:36:12,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:12,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:36:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477606231] [2025-03-16 18:36:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477606231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:36:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890899428] [2025-03-16 18:36:12,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:12,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:12,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:12,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:36:12,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:36:12,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 18:36:13,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 18:36:13,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:13,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:13,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 18:36:13,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:36:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:36:13,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:36:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890899428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:36:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 18:36:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663427968] [2025-03-16 18:36:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:13,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:36:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:13,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:36:13,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:13,219 INFO L87 Difference]: Start difference. First operand 2581 states and 4397 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:36:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:13,476 INFO L93 Difference]: Finished difference Result 7461 states and 12904 transitions. [2025-03-16 18:36:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:36:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2025-03-16 18:36:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:13,508 INFO L225 Difference]: With dead ends: 7461 [2025-03-16 18:36:13,509 INFO L226 Difference]: Without dead ends: 4895 [2025-03-16 18:36:13,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 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:36:13,530 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 693 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:13,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1559 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:36:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2025-03-16 18:36:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4858. [2025-03-16 18:36:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4858 states, 3768 states have (on average 1.6475583864118897) internal successors, (6208), 3942 states have internal predecessors, (6208), 878 states have call successors, (878), 206 states have call predecessors, (878), 211 states have return successors, (1163), 865 states have call predecessors, (1163), 872 states have call successors, (1163) [2025-03-16 18:36:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4858 states to 4858 states and 8249 transitions. [2025-03-16 18:36:13,771 INFO L78 Accepts]: Start accepts. Automaton has 4858 states and 8249 transitions. Word has length 93 [2025-03-16 18:36:13,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:13,771 INFO L471 AbstractCegarLoop]: Abstraction has 4858 states and 8249 transitions. [2025-03-16 18:36:13,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-16 18:36:13,771 INFO L276 IsEmpty]: Start isEmpty. Operand 4858 states and 8249 transitions. [2025-03-16 18:36:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 18:36:13,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:13,774 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] [2025-03-16 18:36:13,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 18:36:13,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:13,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1848148625, now seen corresponding path program 1 times [2025-03-16 18:36:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828345581] [2025-03-16 18:36:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:13,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 18:36:13,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 18:36:13,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:13,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:36:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828345581] [2025-03-16 18:36:14,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828345581] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:36:14,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592806056] [2025-03-16 18:36:14,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:14,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:14,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:36:14,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:36:14,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 18:36:14,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 18:36:14,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:14,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:14,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 18:36:14,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:36:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:36:14,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:36:14,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592806056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:14,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:36:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2025-03-16 18:36:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809250121] [2025-03-16 18:36:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:14,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 18:36:14,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:14,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 18:36:14,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:36:14,446 INFO L87 Difference]: Start difference. First operand 4858 states and 8249 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:36:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:14,795 INFO L93 Difference]: Finished difference Result 14468 states and 24888 transitions. [2025-03-16 18:36:14,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 18:36:14,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-03-16 18:36:14,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:14,874 INFO L225 Difference]: With dead ends: 14468 [2025-03-16 18:36:14,874 INFO L226 Difference]: Without dead ends: 9627 [2025-03-16 18:36:14,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:36:14,914 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 826 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:14,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1708 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:14,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9627 states. [2025-03-16 18:36:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9627 to 9524. [2025-03-16 18:36:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9524 states, 7416 states have (on average 1.6514293419633226) internal successors, (12247), 7744 states have internal predecessors, (12247), 1696 states have call successors, (1696), 394 states have call predecessors, (1696), 411 states have return successors, (2320), 1691 states have call predecessors, (2320), 1686 states have call successors, (2320) [2025-03-16 18:36:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9524 states to 9524 states and 16263 transitions. [2025-03-16 18:36:15,356 INFO L78 Accepts]: Start accepts. Automaton has 9524 states and 16263 transitions. Word has length 98 [2025-03-16 18:36:15,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:15,356 INFO L471 AbstractCegarLoop]: Abstraction has 9524 states and 16263 transitions. [2025-03-16 18:36:15,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:36:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9524 states and 16263 transitions. [2025-03-16 18:36:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 18:36:15,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:15,360 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] [2025-03-16 18:36:15,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 18:36:15,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 18:36:15,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1941260046, now seen corresponding path program 1 times [2025-03-16 18:36:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414980056] [2025-03-16 18:36:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:15,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 18:36:15,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 18:36:15,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:15,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 18:36:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414980056] [2025-03-16 18:36:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414980056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:36:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129056375] [2025-03-16 18:36:15,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:15,786 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:36:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:36:15,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 18:36:16,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 18:36:16,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:16,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:16,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:36:16,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:36:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:36:16,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:36:16,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129056375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:16,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:36:16,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-16 18:36:16,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483481473] [2025-03-16 18:36:16,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:16,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:36:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:16,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:36:16,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-16 18:36:16,141 INFO L87 Difference]: Start difference. First operand 9524 states and 16263 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 18:36:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:16,734 INFO L93 Difference]: Finished difference Result 17987 states and 30794 transitions. [2025-03-16 18:36:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:36:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 98 [2025-03-16 18:36:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:16,792 INFO L225 Difference]: With dead ends: 17987 [2025-03-16 18:36:16,792 INFO L226 Difference]: Without dead ends: 8477 [2025-03-16 18:36:16,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-16 18:36:16,836 INFO L435 NwaCegarLoop]: 888 mSDtfsCounter, 703 mSDsluCounter, 2489 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 3377 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:16,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 3377 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:36:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8477 states. [2025-03-16 18:36:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8477 to 8455. [2025-03-16 18:36:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 6603 states have (on average 1.638194759957595) internal successors, (10817), 6878 states have internal predecessors, (10817), 1478 states have call successors, (1478), 358 states have call predecessors, (1478), 373 states have return successors, (1998), 1474 states have call predecessors, (1998), 1468 states have call successors, (1998) [2025-03-16 18:36:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 14293 transitions. [2025-03-16 18:36:17,191 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 14293 transitions. Word has length 98 [2025-03-16 18:36:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 8455 states and 14293 transitions. [2025-03-16 18:36:17,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 4 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 18:36:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 14293 transitions. [2025-03-16 18:36:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-16 18:36:17,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:17,195 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] [2025-03-16 18:36:17,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:36:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 18:36:17,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1355813529, now seen corresponding path program 1 times [2025-03-16 18:36:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759011471] [2025-03-16 18:36:17,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:17,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-16 18:36:17,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-16 18:36:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:17,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:17,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759011471] [2025-03-16 18:36:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759011471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:17,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:17,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269692317] [2025-03-16 18:36:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:17,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:17,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:17,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:17,462 INFO L87 Difference]: Start difference. First operand 8455 states and 14293 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:36:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:17,830 INFO L93 Difference]: Finished difference Result 16944 states and 28985 transitions. [2025-03-16 18:36:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:36:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-03-16 18:36:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:17,874 INFO L225 Difference]: With dead ends: 16944 [2025-03-16 18:36:17,874 INFO L226 Difference]: Without dead ends: 8503 [2025-03-16 18:36:17,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:36:17,905 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 12 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:17,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8503 states. [2025-03-16 18:36:18,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8503 to 8471. [2025-03-16 18:36:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8471 states, 6615 states have (on average 1.636432350718065) internal successors, (10825), 6890 states have internal predecessors, (10825), 1478 states have call successors, (1478), 366 states have call predecessors, (1478), 377 states have return successors, (1972), 1470 states have call predecessors, (1972), 1468 states have call successors, (1972) [2025-03-16 18:36:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8471 states to 8471 states and 14275 transitions. [2025-03-16 18:36:18,176 INFO L78 Accepts]: Start accepts. Automaton has 8471 states and 14275 transitions. Word has length 98 [2025-03-16 18:36:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:18,177 INFO L471 AbstractCegarLoop]: Abstraction has 8471 states and 14275 transitions. [2025-03-16 18:36:18,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-16 18:36:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 8471 states and 14275 transitions. [2025-03-16 18:36:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-16 18:36:18,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:18,180 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] [2025-03-16 18:36:18,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 18:36:18,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:18,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:18,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1350544536, now seen corresponding path program 1 times [2025-03-16 18:36:18,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:18,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248087079] [2025-03-16 18:36:18,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:18,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-16 18:36:18,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-16 18:36:18,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:18,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:18,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:36:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248087079] [2025-03-16 18:36:18,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248087079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:18,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:18,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:36:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329308220] [2025-03-16 18:36:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:18,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:36:18,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:18,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:36:18,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:36:18,334 INFO L87 Difference]: Start difference. First operand 8471 states and 14275 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:36:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:19,203 INFO L93 Difference]: Finished difference Result 25367 states and 43999 transitions. [2025-03-16 18:36:19,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:36:19,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2025-03-16 18:36:19,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:19,292 INFO L225 Difference]: With dead ends: 25367 [2025-03-16 18:36:19,292 INFO L226 Difference]: Without dead ends: 16910 [2025-03-16 18:36:19,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:36:19,334 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 826 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 4306 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:19,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 4306 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:36:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16910 states. [2025-03-16 18:36:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16910 to 16809. [2025-03-16 18:36:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16809 states, 13140 states have (on average 1.632724505327245) internal successors, (21454), 13681 states have internal predecessors, (21454), 2911 states have call successors, (2911), 726 states have call predecessors, (2911), 757 states have return successors, (4613), 2913 states have call predecessors, (4613), 2893 states have call successors, (4613) [2025-03-16 18:36:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16809 states to 16809 states and 28978 transitions. [2025-03-16 18:36:20,114 INFO L78 Accepts]: Start accepts. Automaton has 16809 states and 28978 transitions. Word has length 106 [2025-03-16 18:36:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:20,114 INFO L471 AbstractCegarLoop]: Abstraction has 16809 states and 28978 transitions. [2025-03-16 18:36:20,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-16 18:36:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16809 states and 28978 transitions. [2025-03-16 18:36:20,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 18:36:20,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:20,117 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:36:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 18:36:20,117 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:20,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:20,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1378601221, now seen corresponding path program 1 times [2025-03-16 18:36:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588141296] [2025-03-16 18:36:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:20,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:20,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 18:36:20,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 18:36:20,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:20,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:36:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588141296] [2025-03-16 18:36:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588141296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536289310] [2025-03-16 18:36:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:20,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:20,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:20,187 INFO L87 Difference]: Start difference. First operand 16809 states and 28978 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:36:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:20,941 INFO L93 Difference]: Finished difference Result 33748 states and 59183 transitions. [2025-03-16 18:36:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:36:20,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-03-16 18:36:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:21,049 INFO L225 Difference]: With dead ends: 33748 [2025-03-16 18:36:21,050 INFO L226 Difference]: Without dead ends: 16953 [2025-03-16 18:36:21,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:36:21,154 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 12 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:21,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2429 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2025-03-16 18:36:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16889. [2025-03-16 18:36:21,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16889 states, 13212 states have (on average 1.6298819255222525) internal successors, (21534), 13737 states have internal predecessors, (21534), 2911 states have call successors, (2911), 758 states have call predecessors, (2911), 765 states have return successors, (4573), 2905 states have call predecessors, (4573), 2893 states have call successors, (4573) [2025-03-16 18:36:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16889 states to 16889 states and 29018 transitions. [2025-03-16 18:36:21,767 INFO L78 Accepts]: Start accepts. Automaton has 16889 states and 29018 transitions. Word has length 107 [2025-03-16 18:36:21,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:21,767 INFO L471 AbstractCegarLoop]: Abstraction has 16889 states and 29018 transitions. [2025-03-16 18:36:21,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-16 18:36:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 16889 states and 29018 transitions. [2025-03-16 18:36:21,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 18:36:21,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:21,771 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] [2025-03-16 18:36:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 18:36:21,771 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1911866668, now seen corresponding path program 1 times [2025-03-16 18:36:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547589702] [2025-03-16 18:36:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:21,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 18:36:21,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 18:36:21,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:21,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:36:21,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:21,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547589702] [2025-03-16 18:36:21,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547589702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:21,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:21,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:36:21,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297970364] [2025-03-16 18:36:21,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:21,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:36:21,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:21,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:36:21,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:36:21,887 INFO L87 Difference]: Start difference. First operand 16889 states and 29018 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:36:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:23,444 INFO L93 Difference]: Finished difference Result 50761 states and 90897 transitions. [2025-03-16 18:36:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:36:23,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2025-03-16 18:36:23,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:23,651 INFO L225 Difference]: With dead ends: 50761 [2025-03-16 18:36:23,651 INFO L226 Difference]: Without dead ends: 33886 [2025-03-16 18:36:23,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:36:23,778 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 823 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 4295 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:23,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 4295 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 18:36:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33886 states. [2025-03-16 18:36:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33886 to 33721. [2025-03-16 18:36:24,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33721 states, 26391 states have (on average 1.6261225417756053) internal successors, (42915), 27432 states have internal predecessors, (42915), 5788 states have call successors, (5788), 1510 states have call predecessors, (5788), 1541 states have return successors, (11190), 5802 states have call predecessors, (11190), 5754 states have call successors, (11190) [2025-03-16 18:36:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33721 states to 33721 states and 59893 transitions. [2025-03-16 18:36:25,473 INFO L78 Accepts]: Start accepts. Automaton has 33721 states and 59893 transitions. Word has length 116 [2025-03-16 18:36:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:25,474 INFO L471 AbstractCegarLoop]: Abstraction has 33721 states and 59893 transitions. [2025-03-16 18:36:25,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-16 18:36:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33721 states and 59893 transitions. [2025-03-16 18:36:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 18:36:25,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:25,478 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] [2025-03-16 18:36:25,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 18:36:25,479 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:25,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1352366256, now seen corresponding path program 1 times [2025-03-16 18:36:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133910670] [2025-03-16 18:36:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:25,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 18:36:25,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 18:36:25,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:25,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 18:36:25,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:25,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133910670] [2025-03-16 18:36:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133910670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:25,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:25,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447630321] [2025-03-16 18:36:25,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:25,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:25,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:25,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:25,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:25,544 INFO L87 Difference]: Start difference. First operand 33721 states and 59893 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:36:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:27,402 INFO L93 Difference]: Finished difference Result 67716 states and 123589 transitions. [2025-03-16 18:36:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:36:27,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-16 18:36:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:27,614 INFO L225 Difference]: With dead ends: 67716 [2025-03-16 18:36:27,614 INFO L226 Difference]: Without dead ends: 34009 [2025-03-16 18:36:27,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:36:27,923 INFO L435 NwaCegarLoop]: 818 mSDtfsCounter, 11 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2432 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:27,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2432 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:36:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34009 states. [2025-03-16 18:36:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34009 to 33881. [2025-03-16 18:36:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33881 states, 26535 states have (on average 1.623327680422084) internal successors, (43075), 27576 states have internal predecessors, (43075), 5788 states have call successors, (5788), 1542 states have call predecessors, (5788), 1557 states have return successors, (11134), 5786 states have call predecessors, (11134), 5754 states have call successors, (11134) [2025-03-16 18:36:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33881 states to 33881 states and 59997 transitions. [2025-03-16 18:36:29,482 INFO L78 Accepts]: Start accepts. Automaton has 33881 states and 59997 transitions. Word has length 117 [2025-03-16 18:36:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:29,482 INFO L471 AbstractCegarLoop]: Abstraction has 33881 states and 59997 transitions. [2025-03-16 18:36:29,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-16 18:36:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 33881 states and 59997 transitions. [2025-03-16 18:36:29,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 18:36:29,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:29,488 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:36:29,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 18:36:29,488 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:29,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:29,488 INFO L85 PathProgramCache]: Analyzing trace with hash 988880878, now seen corresponding path program 1 times [2025-03-16 18:36:29,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:29,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973763655] [2025-03-16 18:36:29,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:29,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:29,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 18:36:29,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 18:36:29,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:29,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 18:36:29,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:29,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973763655] [2025-03-16 18:36:29,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973763655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:29,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:36:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357374455] [2025-03-16 18:36:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:29,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:36:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:29,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:36:29,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:36:29,636 INFO L87 Difference]: Start difference. First operand 33881 states and 59997 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:36:32,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:32,979 INFO L93 Difference]: Finished difference Result 101973 states and 192527 transitions. [2025-03-16 18:36:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:36:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-16 18:36:32,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:33,641 INFO L225 Difference]: With dead ends: 101973 [2025-03-16 18:36:33,641 INFO L226 Difference]: Without dead ends: 68106 [2025-03-16 18:36:33,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:36:33,896 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 817 mSDsluCounter, 3388 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 821 SdHoareTripleChecker+Valid, 4319 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:33,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [821 Valid, 4319 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:36:33,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68106 states. [2025-03-16 18:36:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68106 to 67813. [2025-03-16 18:36:36,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67813 states, 53118 states have (on average 1.6204676380887835) internal successors, (86076), 55191 states have internal predecessors, (86076), 11553 states have call successors, (11553), 3078 states have call predecessors, (11553), 3141 states have return successors, (28935), 11591 states have call predecessors, (28935), 11487 states have call successors, (28935) [2025-03-16 18:36:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67813 states to 67813 states and 126564 transitions. [2025-03-16 18:36:37,328 INFO L78 Accepts]: Start accepts. Automaton has 67813 states and 126564 transitions. Word has length 127 [2025-03-16 18:36:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:37,329 INFO L471 AbstractCegarLoop]: Abstraction has 67813 states and 126564 transitions. [2025-03-16 18:36:37,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-16 18:36:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 67813 states and 126564 transitions. [2025-03-16 18:36:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-16 18:36:37,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:37,334 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:36:37,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 18:36:37,335 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:37,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 2070548071, now seen corresponding path program 1 times [2025-03-16 18:36:37,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:37,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417488199] [2025-03-16 18:36:37,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:37,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:37,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-16 18:36:37,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-16 18:36:37,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:37,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:36:37,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417488199] [2025-03-16 18:36:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417488199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:37,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 18:36:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876836677] [2025-03-16 18:36:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:37,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 18:36:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:37,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 18:36:37,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 18:36:37,417 INFO L87 Difference]: Start difference. First operand 67813 states and 126564 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 18:36:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:41,978 INFO L93 Difference]: Finished difference Result 136252 states and 265819 transitions. [2025-03-16 18:36:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:36:41,978 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-03-16 18:36:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:42,466 INFO L225 Difference]: With dead ends: 136252 [2025-03-16 18:36:42,466 INFO L226 Difference]: Without dead ends: 68453 [2025-03-16 18:36:43,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:36:43,477 INFO L435 NwaCegarLoop]: 817 mSDtfsCounter, 9 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2429 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:43,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2429 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:36:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68453 states. [2025-03-16 18:36:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68453 to 68197. [2025-03-16 18:36:45,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68197 states, 53470 states have (on average 1.616981484944829) internal successors, (86460), 55543 states have internal predecessors, (86460), 11553 states have call successors, (11553), 3142 states have call predecessors, (11553), 3173 states have return successors, (28871), 11559 states have call predecessors, (28871), 11487 states have call successors, (28871) [2025-03-16 18:36:46,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68197 states to 68197 states and 126884 transitions. [2025-03-16 18:36:46,827 INFO L78 Accepts]: Start accepts. Automaton has 68197 states and 126884 transitions. Word has length 128 [2025-03-16 18:36:46,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:46,827 INFO L471 AbstractCegarLoop]: Abstraction has 68197 states and 126884 transitions. [2025-03-16 18:36:46,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-16 18:36:46,828 INFO L276 IsEmpty]: Start isEmpty. Operand 68197 states and 126884 transitions. [2025-03-16 18:36:46,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 18:36:46,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:46,834 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:36:46,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 18:36:46,835 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:46,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:46,835 INFO L85 PathProgramCache]: Analyzing trace with hash -82919614, now seen corresponding path program 1 times [2025-03-16 18:36:46,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:46,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378098217] [2025-03-16 18:36:46,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:46,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:46,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-16 18:36:46,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-16 18:36:46,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:46,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-16 18:36:46,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:46,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378098217] [2025-03-16 18:36:46,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378098217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:46,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:36:46,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:36:46,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402669299] [2025-03-16 18:36:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:46,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 18:36:46,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:46,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 18:36:46,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 18:36:46,956 INFO L87 Difference]: Start difference. First operand 68197 states and 126884 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-16 18:36:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:36:50,804 INFO L93 Difference]: Finished difference Result 139159 states and 261439 transitions. [2025-03-16 18:36:50,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 18:36:50,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 139 [2025-03-16 18:36:50,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:36:51,534 INFO L225 Difference]: With dead ends: 139159 [2025-03-16 18:36:51,534 INFO L226 Difference]: Without dead ends: 70928 [2025-03-16 18:36:52,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:36:52,248 INFO L435 NwaCegarLoop]: 884 mSDtfsCounter, 689 mSDsluCounter, 2509 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 3393 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:36:52,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 3393 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:36:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70928 states. [2025-03-16 18:36:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70928 to 70765. [2025-03-16 18:36:54,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70765 states, 55516 states have (on average 1.6070141941062037) internal successors, (89215), 57666 states have internal predecessors, (89215), 11916 states have call successors, (11916), 3317 states have call predecessors, (11916), 3332 states have return successors, (29370), 11828 states have call predecessors, (29370), 11850 states have call successors, (29370) [2025-03-16 18:36:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70765 states to 70765 states and 130501 transitions. [2025-03-16 18:36:55,484 INFO L78 Accepts]: Start accepts. Automaton has 70765 states and 130501 transitions. Word has length 139 [2025-03-16 18:36:55,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:36:55,484 INFO L471 AbstractCegarLoop]: Abstraction has 70765 states and 130501 transitions. [2025-03-16 18:36:55,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 4 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-16 18:36:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 70765 states and 130501 transitions. [2025-03-16 18:36:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-16 18:36:55,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:36:55,491 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:36:55,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 18:36:55,491 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:36:55,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:36:55,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1197638179, now seen corresponding path program 1 times [2025-03-16 18:36:55,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:36:55,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115699003] [2025-03-16 18:36:55,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:55,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:36:55,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 18:36:55,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 18:36:55,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:55,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-16 18:36:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:36:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115699003] [2025-03-16 18:36:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115699003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:36:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782171012] [2025-03-16 18:36:55,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:36:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:36:55,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:36:55,668 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:36:55,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:36:55,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-16 18:36:55,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-16 18:36:55,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:36:55,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:36:55,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1904 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:36:55,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:36:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:36:56,317 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 18:36:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782171012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:36:56,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 18:36:56,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-16 18:36:56,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368873889] [2025-03-16 18:36:56,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:36:56,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 18:36:56,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:36:56,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 18:36:56,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:36:56,318 INFO L87 Difference]: Start difference. First operand 70765 states and 130501 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 5 states have call successors, (19), 4 states have call predecessors, (19), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17)