./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b60f36c6abb85551baa468c8faf905605a37519376312e75fd6944689b1d0b8d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:37:12,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:37:12,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:37:12,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:37:12,179 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:37:12,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:37:12,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:37:12,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:37:12,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:37:12,205 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:37:12,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:37:12,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:37:12,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:37:12,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:37:12,206 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:37:12,206 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:37:12,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:37:12,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:12,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:37:12,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:37:12,208 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-jdk21/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 -> b60f36c6abb85551baa468c8faf905605a37519376312e75fd6944689b1d0b8d [2025-02-05 15:37:12,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:37:12,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:37:12,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:37:12,389 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:37:12,389 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:37:12,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c [2025-02-05 15:37:13,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e768d6ff0/706f0f8671434705a4d2be3212f3b187/FLAGa706bb6c7 [2025-02-05 15:37:13,977 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:37:13,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c [2025-02-05 15:37:13,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e768d6ff0/706f0f8671434705a4d2be3212f3b187/FLAGa706bb6c7 [2025-02-05 15:37:14,192 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e768d6ff0/706f0f8671434705a4d2be3212f3b187 [2025-02-05 15:37:14,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:37:14,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:37:14,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:14,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:37:14,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:37:14,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb9d2e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14, skipping insertion in model container [2025-02-05 15:37:14,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:37:14,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c[32398,32411] [2025-02-05 15:37:14,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:14,568 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:37:14,575 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-02-05 15:37:14,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [86] [2025-02-05 15:37:14,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [452] [2025-02-05 15:37:14,576 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1120] [2025-02-05 15:37:14,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1476] [2025-02-05 15:37:14,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1485] [2025-02-05 15:37:14,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2984] [2025-02-05 15:37:14,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [3102] [2025-02-05 15:37:14,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3288] [2025-02-05 15:37:14,577 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [3303] [2025-02-05 15:37:14,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product18.cil.c[32398,32411] [2025-02-05 15:37:14,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:37:14,718 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:37:14,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14 WrapperNode [2025-02-05 15:37:14,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:37:14,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:14,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:37:14,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:37:14,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,786 INFO L138 Inliner]: procedures = 90, calls = 344, calls flagged for inlining = 25, calls inlined = 21, statements flattened = 815 [2025-02-05 15:37:14,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:37:14,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:37:14,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:37:14,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:37:14,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,817 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2025-02-05 15:37:14,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:37:14,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:37:14,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:37:14,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:37:14,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (1/1) ... [2025-02-05 15:37:14,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:37:14,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:14,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:37:14,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:37:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:37:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2025-02-05 15:37:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2025-02-05 15:37:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2025-02-05 15:37:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2025-02-05 15:37:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2025-02-05 15:37:14,895 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2025-02-05 15:37:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2025-02-05 15:37:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2025-02-05 15:37:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2025-02-05 15:37:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2025-02-05 15:37:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2025-02-05 15:37:14,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2025-02-05 15:37:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2025-02-05 15:37:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2025-02-05 15:37:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2025-02-05 15:37:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2025-02-05 15:37:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2025-02-05 15:37:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2025-02-05 15:37:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2025-02-05 15:37:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-05 15:37:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:37:14,900 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2025-02-05 15:37:14,900 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2025-02-05 15:37:15,056 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:37:15,058 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:37:15,084 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: #res := ~retValue_acc~14; [2025-02-05 15:37:15,111 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: #res := ~retValue_acc~25; [2025-02-05 15:37:15,131 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3021: #res := ~retValue_acc~23; [2025-02-05 15:37:15,136 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: #res := ~retValue_acc~10; [2025-02-05 15:37:15,362 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2255: #res := ~retValue_acc~18; [2025-02-05 15:37:15,408 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2359: #res := ~retValue_acc~21; [2025-02-05 15:37:15,418 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: #res := ~retValue_acc~24; [2025-02-05 15:37:15,513 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2345-1: stopRequestedAtCurrentFloor_#res#1 := stopRequestedAtCurrentFloor_~retValue_acc~20#1; [2025-02-05 15:37:15,521 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1761: #res := ~retValue_acc~13; [2025-02-05 15:37:15,587 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-1: anyStopRequested_#res#1 := anyStopRequested_~retValue_acc~16#1; [2025-02-05 15:37:15,587 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1903-1: isIdle_#res#1 := isIdle_~retValue_acc~17#1; [2025-02-05 15:37:15,679 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1718-1: getCurrentFloorID_#res#1 := getCurrentFloorID_~retValue_acc~11#1; [2025-02-05 15:37:15,679 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727-1: areDoorsOpen_#res#1 := areDoorsOpen_~retValue_acc~12#1; [2025-02-05 15:37:15,758 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L806: #res := ~retValue_acc~6; [2025-02-05 15:37:15,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L83-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2025-02-05 15:37:15,836 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473-1: main_#res#1 := main_~retValue_acc~9#1; [2025-02-05 15:37:15,844 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: #res := ~retValue_acc~5; [2025-02-05 15:37:15,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1117: #res := ~retValue_acc~7; [2025-02-05 15:37:15,955 INFO L? ?]: Removed 439 outVars from TransFormulas that were not future-live. [2025-02-05 15:37:15,956 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:37:15,970 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:37:15,970 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:37:15,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:15 BoogieIcfgContainer [2025-02-05 15:37:15,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:37:15,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:37:15,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:37:15,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:37:15,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:37:14" (1/3) ... [2025-02-05 15:37:15,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6037a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:15, skipping insertion in model container [2025-02-05 15:37:15,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:37:14" (2/3) ... [2025-02-05 15:37:15,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6037a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:37:15, skipping insertion in model container [2025-02-05 15:37:15,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:37:15" (3/3) ... [2025-02-05 15:37:15,977 INFO L128 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product18.cil.c [2025-02-05 15:37:15,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:37:15,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG elevator_spec3_product18.cil.c that has 26 procedures, 569 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:37:16,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:37:16,044 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;@36567ce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:37:16,044 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:37:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand has 569 states, 439 states have (on average 1.683371298405467) internal successors, (739), 460 states have internal predecessors, (739), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-05 15:37:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 15:37:16,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:16,056 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] [2025-02-05 15:37:16,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:16,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:16,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1968764064, now seen corresponding path program 1 times [2025-02-05 15:37:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:16,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858691336] [2025-02-05 15:37:16,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:16,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 15:37:16,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 15:37:16,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:16,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:16,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858691336] [2025-02-05 15:37:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858691336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:16,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:16,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:16,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130361497] [2025-02-05 15:37:16,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:16,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:16,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:16,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:16,680 INFO L87 Difference]: Start difference. First operand has 569 states, 439 states have (on average 1.683371298405467) internal successors, (739), 460 states have internal predecessors, (739), 102 states have call successors, (102), 25 states have call predecessors, (102), 25 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:16,871 INFO L93 Difference]: Finished difference Result 1135 states and 1898 transitions. [2025-02-05 15:37:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2025-02-05 15:37:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:16,884 INFO L225 Difference]: With dead ends: 1135 [2025-02-05 15:37:16,885 INFO L226 Difference]: Without dead ends: 573 [2025-02-05 15:37:16,890 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-02-05 15:37:16,892 INFO L435 NwaCegarLoop]: 928 mSDtfsCounter, 91 mSDsluCounter, 4554 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 5482 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-02-05 15:37:16,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 5482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:37:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-02-05 15:37:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571. [2025-02-05 15:37:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 442 states have (on average 1.6764705882352942) internal successors, (741), 462 states have internal predecessors, (741), 103 states have call successors, (103), 25 states have call predecessors, (103), 25 states have return successors, (102), 97 states have call predecessors, (102), 100 states have call successors, (102) [2025-02-05 15:37:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 946 transitions. [2025-02-05 15:37:16,973 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 946 transitions. Word has length 63 [2025-02-05 15:37:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 946 transitions. [2025-02-05 15:37:16,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 946 transitions. [2025-02-05 15:37:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 15:37:16,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:16,980 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] [2025-02-05 15:37:16,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:37:16,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 892109275, now seen corresponding path program 1 times [2025-02-05 15:37:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480014753] [2025-02-05 15:37:16,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:16,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:17,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 15:37:17,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 15:37:17,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:17,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:17,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480014753] [2025-02-05 15:37:17,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480014753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:17,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:17,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:17,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326058938] [2025-02-05 15:37:17,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:17,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:17,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:17,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:17,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:17,166 INFO L87 Difference]: Start difference. First operand 571 states and 946 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:17,227 INFO L93 Difference]: Finished difference Result 1124 states and 1873 transitions. [2025-02-05 15:37:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 64 [2025-02-05 15:37:17,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:17,231 INFO L225 Difference]: With dead ends: 1124 [2025-02-05 15:37:17,231 INFO L226 Difference]: Without dead ends: 547 [2025-02-05 15:37:17,233 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-02-05 15:37:17,233 INFO L435 NwaCegarLoop]: 916 mSDtfsCounter, 14 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2743 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-02-05 15:37:17,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2743 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-05 15:37:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-05 15:37:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 421 states have (on average 1.667458432304038) internal successors, (702), 439 states have internal predecessors, (702), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 903 transitions. [2025-02-05 15:37:17,266 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 903 transitions. Word has length 64 [2025-02-05 15:37:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:17,266 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 903 transitions. [2025-02-05 15:37:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 903 transitions. [2025-02-05 15:37:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 15:37:17,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:17,270 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] [2025-02-05 15:37:17,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:37:17,270 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:17,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1805670225, now seen corresponding path program 1 times [2025-02-05 15:37:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:17,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215355968] [2025-02-05 15:37:17,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:17,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 15:37:17,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 15:37:17,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:17,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:17,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:17,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:17,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215355968] [2025-02-05 15:37:17,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215355968] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:17,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:17,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:17,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922787323] [2025-02-05 15:37:17,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:17,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:17,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:17,485 INFO L87 Difference]: Start difference. First operand 547 states and 903 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:17,570 INFO L93 Difference]: Finished difference Result 1087 states and 1805 transitions. [2025-02-05 15:37:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 64 [2025-02-05 15:37:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:17,577 INFO L225 Difference]: With dead ends: 1087 [2025-02-05 15:37:17,577 INFO L226 Difference]: Without dead ends: 541 [2025-02-05 15:37:17,580 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-02-05 15:37:17,580 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 77 mSDsluCounter, 4390 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 5282 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-02-05 15:37:17,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 5282 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-02-05 15:37:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-02-05 15:37:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 415 states have (on average 1.6602409638554216) internal successors, (689), 433 states have internal predecessors, (689), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 890 transitions. [2025-02-05 15:37:17,623 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 890 transitions. Word has length 64 [2025-02-05 15:37:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:17,624 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 890 transitions. [2025-02-05 15:37:17,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 890 transitions. [2025-02-05 15:37:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 15:37:17,625 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:17,625 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] [2025-02-05 15:37:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:37:17,625 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:17,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:17,625 INFO L85 PathProgramCache]: Analyzing trace with hash -677469158, now seen corresponding path program 1 times [2025-02-05 15:37:17,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817727777] [2025-02-05 15:37:17,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:17,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 15:37:17,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 15:37:17,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:17,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817727777] [2025-02-05 15:37:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817727777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:17,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:17,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:17,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458234759] [2025-02-05 15:37:17,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:17,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:17,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:17,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:17,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:17,824 INFO L87 Difference]: Start difference. First operand 541 states and 890 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:17,895 INFO L93 Difference]: Finished difference Result 1075 states and 1779 transitions. [2025-02-05 15:37:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2025-02-05 15:37:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:17,899 INFO L225 Difference]: With dead ends: 1075 [2025-02-05 15:37:17,899 INFO L226 Difference]: Without dead ends: 535 [2025-02-05 15:37:17,902 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-02-05 15:37:17,904 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 63 mSDsluCounter, 4342 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 5222 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-02-05 15:37:17,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 5222 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-02-05 15:37:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-02-05 15:37:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 409 states have (on average 1.6528117359413204) internal successors, (676), 427 states have internal predecessors, (676), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 877 transitions. [2025-02-05 15:37:17,926 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 877 transitions. Word has length 65 [2025-02-05 15:37:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:17,927 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 877 transitions. [2025-02-05 15:37:17,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:17,928 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 877 transitions. [2025-02-05 15:37:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 15:37:17,928 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:17,928 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:37:17,928 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:17,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash -2067576373, now seen corresponding path program 1 times [2025-02-05 15:37:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:17,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850809469] [2025-02-05 15:37:17,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:17,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 15:37:17,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 15:37:17,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:17,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:18,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850809469] [2025-02-05 15:37:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850809469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:18,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136351248] [2025-02-05 15:37:18,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:18,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:18,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:18,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:18,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:18,116 INFO L87 Difference]: Start difference. First operand 535 states and 877 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:18,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:18,179 INFO L93 Difference]: Finished difference Result 1063 states and 1753 transitions. [2025-02-05 15:37:18,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:18,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 15:37:18,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:18,183 INFO L225 Difference]: With dead ends: 1063 [2025-02-05 15:37:18,183 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 15:37:18,184 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-02-05 15:37:18,185 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 49 mSDsluCounter, 4294 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 5162 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-02-05 15:37:18,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 5162 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:18,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 15:37:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-05 15:37:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6451612903225807) internal successors, (663), 421 states have internal predecessors, (663), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 864 transitions. [2025-02-05 15:37:18,201 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 864 transitions. Word has length 66 [2025-02-05 15:37:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:18,202 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 864 transitions. [2025-02-05 15:37:18,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:18,202 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 864 transitions. [2025-02-05 15:37:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 15:37:18,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:18,202 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] [2025-02-05 15:37:18,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:37:18,203 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:18,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:18,203 INFO L85 PathProgramCache]: Analyzing trace with hash -780562941, now seen corresponding path program 1 times [2025-02-05 15:37:18,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:18,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250342962] [2025-02-05 15:37:18,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:18,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:18,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 15:37:18,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 15:37:18,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:18,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:18,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250342962] [2025-02-05 15:37:18,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250342962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:18,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:18,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:37:18,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609068931] [2025-02-05 15:37:18,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:18,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:37:18,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:18,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:37:18,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:18,322 INFO L87 Difference]: Start difference. First operand 529 states and 864 transitions. Second operand has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:18,388 INFO L93 Difference]: Finished difference Result 1051 states and 1727 transitions. [2025-02-05 15:37:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 15:37:18,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 66 [2025-02-05 15:37:18,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:18,392 INFO L225 Difference]: With dead ends: 1051 [2025-02-05 15:37:18,392 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 15:37:18,394 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-02-05 15:37:18,395 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 24 mSDsluCounter, 4258 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5114 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-02-05 15:37:18,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5114 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 15:37:18,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-05 15:37:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6426799007444168) internal successors, (662), 421 states have internal predecessors, (662), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 863 transitions. [2025-02-05 15:37:18,414 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 863 transitions. Word has length 66 [2025-02-05 15:37:18,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:18,415 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 863 transitions. [2025-02-05 15:37:18,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 863 transitions. [2025-02-05 15:37:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 15:37:18,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:18,418 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:37:18,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:18,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:18,419 INFO L85 PathProgramCache]: Analyzing trace with hash 361542548, now seen corresponding path program 1 times [2025-02-05 15:37:18,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:18,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262410301] [2025-02-05 15:37:18,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:18,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 15:37:18,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 15:37:18,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:18,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262410301] [2025-02-05 15:37:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262410301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:18,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704243971] [2025-02-05 15:37:18,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:18,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:18,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:18,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:18,502 INFO L87 Difference]: Start difference. First operand 529 states and 863 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:18,541 INFO L93 Difference]: Finished difference Result 1042 states and 1712 transitions. [2025-02-05 15:37:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:18,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2025-02-05 15:37:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:18,545 INFO L225 Difference]: With dead ends: 1042 [2025-02-05 15:37:18,545 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 15:37:18,547 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-02-05 15:37:18,547 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 15 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2529 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-02-05 15:37:18,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2529 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:18,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 15:37:18,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-05 15:37:18,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6401985111662531) internal successors, (661), 421 states have internal predecessors, (661), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 862 transitions. [2025-02-05 15:37:18,564 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 862 transitions. Word has length 67 [2025-02-05 15:37:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:18,564 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 862 transitions. [2025-02-05 15:37:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 862 transitions. [2025-02-05 15:37:18,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 15:37:18,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:18,566 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:18,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:37:18,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:18,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash -458561421, now seen corresponding path program 1 times [2025-02-05 15:37:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:18,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982521565] [2025-02-05 15:37:18,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:18,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 15:37:18,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 15:37:18,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:18,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:18,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:18,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982521565] [2025-02-05 15:37:18,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982521565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:18,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:18,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:18,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744377829] [2025-02-05 15:37:18,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:18,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:18,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:18,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:18,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:18,648 INFO L87 Difference]: Start difference. First operand 529 states and 862 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:18,683 INFO L93 Difference]: Finished difference Result 1042 states and 1710 transitions. [2025-02-05 15:37:18,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2025-02-05 15:37:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:18,687 INFO L225 Difference]: With dead ends: 1042 [2025-02-05 15:37:18,687 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 15:37:18,690 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-02-05 15:37:18,691 INFO L435 NwaCegarLoop]: 849 mSDtfsCounter, 14 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2531 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-02-05 15:37:18,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2531 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 15:37:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-05 15:37:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6377171215880892) internal successors, (660), 421 states have internal predecessors, (660), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 861 transitions. [2025-02-05 15:37:18,724 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 861 transitions. Word has length 68 [2025-02-05 15:37:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:18,724 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 861 transitions. [2025-02-05 15:37:18,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 861 transitions. [2025-02-05 15:37:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 15:37:18,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:18,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:18,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:37:18,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:18,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2007866999, now seen corresponding path program 1 times [2025-02-05 15:37:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009495529] [2025-02-05 15:37:18,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:18,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 15:37:18,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 15:37:18,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:18,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:18,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:18,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009495529] [2025-02-05 15:37:18,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009495529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:18,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933458512] [2025-02-05 15:37:18,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:18,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:18,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:18,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:18,828 INFO L87 Difference]: Start difference. First operand 529 states and 861 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:18,866 INFO L93 Difference]: Finished difference Result 1042 states and 1708 transitions. [2025-02-05 15:37:18,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:18,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2025-02-05 15:37:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:18,870 INFO L225 Difference]: With dead ends: 1042 [2025-02-05 15:37:18,870 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 15:37:18,872 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-02-05 15:37:18,872 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 13 mSDsluCounter, 1683 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2533 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-02-05 15:37:18,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2533 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 15:37:18,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-05 15:37:18,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6352357320099256) internal successors, (659), 421 states have internal predecessors, (659), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 860 transitions. [2025-02-05 15:37:18,887 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 860 transitions. Word has length 69 [2025-02-05 15:37:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:18,887 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 860 transitions. [2025-02-05 15:37:18,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 860 transitions. [2025-02-05 15:37:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 15:37:18,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:18,889 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:18,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:37:18,889 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:18,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1017382922, now seen corresponding path program 1 times [2025-02-05 15:37:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425462160] [2025-02-05 15:37:18,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:18,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 15:37:18,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 15:37:18,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:18,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:18,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425462160] [2025-02-05 15:37:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425462160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076057252] [2025-02-05 15:37:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:18,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:18,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:18,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:18,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:18,957 INFO L87 Difference]: Start difference. First operand 529 states and 860 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:18,989 INFO L93 Difference]: Finished difference Result 1042 states and 1706 transitions. [2025-02-05 15:37:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:37:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2025-02-05 15:37:18,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:18,993 INFO L225 Difference]: With dead ends: 1042 [2025-02-05 15:37:18,993 INFO L226 Difference]: Without dead ends: 529 [2025-02-05 15:37:18,995 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-02-05 15:37:18,996 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 12 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2535 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-02-05 15:37:18,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2535 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-02-05 15:37:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-02-05 15:37:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 403 states have (on average 1.6327543424317619) internal successors, (658), 421 states have internal predecessors, (658), 102 states have call successors, (102), 25 states have call predecessors, (102), 23 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 15:37:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 859 transitions. [2025-02-05 15:37:19,010 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 859 transitions. Word has length 70 [2025-02-05 15:37:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:19,010 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 859 transitions. [2025-02-05 15:37:19,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 15:37:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 859 transitions. [2025-02-05 15:37:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 15:37:19,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:19,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:37:19,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1808997722, now seen corresponding path program 1 times [2025-02-05 15:37:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045544217] [2025-02-05 15:37:19,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:19,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 15:37:19,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:37:19,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:19,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:19,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045544217] [2025-02-05 15:37:19,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045544217] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:19,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377260932] [2025-02-05 15:37:19,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:19,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:37:19,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:37:19,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 15:37:19,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 15:37:19,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:19,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:19,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:19,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:19,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377260932] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:19,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178326780] [2025-02-05 15:37:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:19,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:19,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:19,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:19,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:19,554 INFO L87 Difference]: Start difference. First operand 529 states and 859 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:19,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:19,610 INFO L93 Difference]: Finished difference Result 1499 states and 2467 transitions. [2025-02-05 15:37:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:19,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 71 [2025-02-05 15:37:19,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:19,618 INFO L225 Difference]: With dead ends: 1499 [2025-02-05 15:37:19,618 INFO L226 Difference]: Without dead ends: 988 [2025-02-05 15:37:19,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 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-02-05 15:37:19,621 INFO L435 NwaCegarLoop]: 868 mSDtfsCounter, 824 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1624 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-02-05 15:37:19,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1624 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2025-02-05 15:37:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 973. [2025-02-05 15:37:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 748 states have (on average 1.6470588235294117) internal successors, (1232), 783 states have internal predecessors, (1232), 180 states have call successors, (180), 45 states have call predecessors, (180), 44 states have return successors, (182), 172 states have call predecessors, (182), 177 states have call successors, (182) [2025-02-05 15:37:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1594 transitions. [2025-02-05 15:37:19,655 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1594 transitions. Word has length 71 [2025-02-05 15:37:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:19,656 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1594 transitions. [2025-02-05 15:37:19,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1594 transitions. [2025-02-05 15:37:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 15:37:19,658 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:19,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:19,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:37:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 15:37:19,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:19,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2095401490, now seen corresponding path program 1 times [2025-02-05 15:37:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143970310] [2025-02-05 15:37:19,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:37:19,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:37:19,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:19,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:20,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:20,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143970310] [2025-02-05 15:37:20,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143970310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:20,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438883858] [2025-02-05 15:37:20,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:20,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:20,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:20,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:37:20,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:37:20,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 15:37:20,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 15:37:20,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:20,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:20,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:37:20,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:20,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:20,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:20,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438883858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:20,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:20,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 15:37:20,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605501841] [2025-02-05 15:37:20,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:20,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:37:20,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:20,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:37:20,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:37:20,338 INFO L87 Difference]: Start difference. First operand 973 states and 1594 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:20,414 INFO L93 Difference]: Finished difference Result 2387 states and 3939 transitions. [2025-02-05 15:37:20,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:37:20,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 72 [2025-02-05 15:37:20,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:20,424 INFO L225 Difference]: With dead ends: 2387 [2025-02-05 15:37:20,424 INFO L226 Difference]: Without dead ends: 1432 [2025-02-05 15:37:20,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 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-02-05 15:37:20,429 INFO L435 NwaCegarLoop]: 929 mSDtfsCounter, 822 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1686 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-02-05 15:37:20,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1686 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-02-05 15:37:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1384. [2025-02-05 15:37:20,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1066 states have (on average 1.6604127579737336) internal successors, (1770), 1118 states have internal predecessors, (1770), 255 states have call successors, (255), 62 states have call predecessors, (255), 62 states have return successors, (262), 245 states have call predecessors, (262), 252 states have call successors, (262) [2025-02-05 15:37:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2287 transitions. [2025-02-05 15:37:20,486 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2287 transitions. Word has length 72 [2025-02-05 15:37:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:20,486 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2287 transitions. [2025-02-05 15:37:20,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 15:37:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2287 transitions. [2025-02-05 15:37:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 15:37:20,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:20,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:20,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:37:20,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:20,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:20,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -974306584, now seen corresponding path program 1 times [2025-02-05 15:37:20,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:20,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360774955] [2025-02-05 15:37:20,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:20,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 15:37:20,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 15:37:20,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:20,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:20,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:20,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360774955] [2025-02-05 15:37:20,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360774955] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:20,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:20,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:20,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126737186] [2025-02-05 15:37:20,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:20,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:20,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:20,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:20,847 INFO L87 Difference]: Start difference. First operand 1384 states and 2287 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:21,303 INFO L93 Difference]: Finished difference Result 4088 states and 6886 transitions. [2025-02-05 15:37:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:21,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 74 [2025-02-05 15:37:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:21,323 INFO L225 Difference]: With dead ends: 4088 [2025-02-05 15:37:21,323 INFO L226 Difference]: Without dead ends: 2722 [2025-02-05 15:37:21,330 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-02-05 15:37:21,330 INFO L435 NwaCegarLoop]: 994 mSDtfsCounter, 849 mSDsluCounter, 3561 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 4555 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:21,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 4555 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2025-02-05 15:37:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2675. [2025-02-05 15:37:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2065 states have (on average 1.664406779661017) internal successors, (3437), 2165 states have internal predecessors, (3437), 489 states have call successors, (489), 118 states have call predecessors, (489), 120 states have return successors, (577), 475 states have call predecessors, (577), 485 states have call successors, (577) [2025-02-05 15:37:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 4503 transitions. [2025-02-05 15:37:21,462 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 4503 transitions. Word has length 74 [2025-02-05 15:37:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 2675 states and 4503 transitions. [2025-02-05 15:37:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-05 15:37:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 4503 transitions. [2025-02-05 15:37:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:37:21,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:21,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:21,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:37:21,464 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:21,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:21,464 INFO L85 PathProgramCache]: Analyzing trace with hash -191047273, now seen corresponding path program 1 times [2025-02-05 15:37:21,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:21,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507305505] [2025-02-05 15:37:21,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:21,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:37:21,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:37:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 15:37:21,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:21,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507305505] [2025-02-05 15:37:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507305505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:21,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018913572] [2025-02-05 15:37:21,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:21,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:21,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:21,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:37:21,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:37:21,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:37:21,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:37:21,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:21,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:21,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 1506 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:37:21,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:37:21,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018913572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:21,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-02-05 15:37:21,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330373294] [2025-02-05 15:37:21,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:21,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:37:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:21,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:37:21,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:37:21,935 INFO L87 Difference]: Start difference. First operand 2675 states and 4503 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 15:37:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:22,324 INFO L93 Difference]: Finished difference Result 7216 states and 12348 transitions. [2025-02-05 15:37:22,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:37:22,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 75 [2025-02-05 15:37:22,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:22,356 INFO L225 Difference]: With dead ends: 7216 [2025-02-05 15:37:22,356 INFO L226 Difference]: Without dead ends: 4559 [2025-02-05 15:37:22,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:37:22,372 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 723 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3226 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:22,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3226 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:37:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2025-02-05 15:37:22,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 4516. [2025-02-05 15:37:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 3484 states have (on average 1.6165327210103329) internal successors, (5632), 3650 states have internal predecessors, (5632), 814 states have call successors, (814), 210 states have call predecessors, (814), 217 states have return successors, (1070), 795 states have call predecessors, (1070), 808 states have call successors, (1070) [2025-02-05 15:37:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 7516 transitions. [2025-02-05 15:37:22,541 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 7516 transitions. Word has length 75 [2025-02-05 15:37:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:22,541 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 7516 transitions. [2025-02-05 15:37:22,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 4 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-05 15:37:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 7516 transitions. [2025-02-05 15:37:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-05 15:37:22,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:22,542 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:22,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:37:22,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:22,743 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:22,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:22,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1334365037, now seen corresponding path program 1 times [2025-02-05 15:37:22,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:22,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610792430] [2025-02-05 15:37:22,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:22,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:22,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-05 15:37:22,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-05 15:37:22,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:22,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 15:37:22,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:22,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610792430] [2025-02-05 15:37:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610792430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:22,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542336644] [2025-02-05 15:37:22,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:22,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:22,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:22,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:22,814 INFO L87 Difference]: Start difference. First operand 4516 states and 7516 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:23,057 INFO L93 Difference]: Finished difference Result 9038 states and 15197 transitions. [2025-02-05 15:37:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2025-02-05 15:37:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:23,089 INFO L225 Difference]: With dead ends: 9038 [2025-02-05 15:37:23,089 INFO L226 Difference]: Without dead ends: 4540 [2025-02-05 15:37:23,117 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-02-05 15:37:23,118 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 12 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2501 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-02-05 15:37:23,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2501 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2025-02-05 15:37:23,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4524. [2025-02-05 15:37:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 3490 states have (on average 1.6148997134670486) internal successors, (5636), 3656 states have internal predecessors, (5636), 814 states have call successors, (814), 214 states have call predecessors, (814), 219 states have return successors, (1057), 793 states have call predecessors, (1057), 808 states have call successors, (1057) [2025-02-05 15:37:23,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 7507 transitions. [2025-02-05 15:37:23,317 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 7507 transitions. Word has length 75 [2025-02-05 15:37:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:23,317 INFO L471 AbstractCegarLoop]: Abstraction has 4524 states and 7507 transitions. [2025-02-05 15:37:23,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 15:37:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 7507 transitions. [2025-02-05 15:37:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:37:23,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:23,322 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] [2025-02-05 15:37:23,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:37:23,322 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:23,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:23,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1736821385, now seen corresponding path program 1 times [2025-02-05 15:37:23,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:23,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201747027] [2025-02-05 15:37:23,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:23,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:23,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:37:23,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:37:23,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:23,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 15:37:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201747027] [2025-02-05 15:37:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201747027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067928499] [2025-02-05 15:37:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:23,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:23,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:23,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:23,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:23,475 INFO L87 Difference]: Start difference. First operand 4524 states and 7507 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:37:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:24,206 INFO L93 Difference]: Finished difference Result 13523 states and 23249 transitions. [2025-02-05 15:37:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-02-05 15:37:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:24,265 INFO L225 Difference]: With dead ends: 13523 [2025-02-05 15:37:24,265 INFO L226 Difference]: Without dead ends: 9017 [2025-02-05 15:37:24,286 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-02-05 15:37:24,287 INFO L435 NwaCegarLoop]: 956 mSDtfsCounter, 844 mSDsluCounter, 3454 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:24,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 4410 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 15:37:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2025-02-05 15:37:24,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 8948. [2025-02-05 15:37:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8948 states, 6910 states have (on average 1.612590448625181) internal successors, (11143), 7236 states have internal predecessors, (11143), 1600 states have call successors, (1600), 422 states have call predecessors, (1600), 437 states have return successors, (2521), 1569 states have call predecessors, (2521), 1590 states have call successors, (2521) [2025-02-05 15:37:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8948 states to 8948 states and 15264 transitions. [2025-02-05 15:37:24,670 INFO L78 Accepts]: Start accepts. Automaton has 8948 states and 15264 transitions. Word has length 83 [2025-02-05 15:37:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:24,671 INFO L471 AbstractCegarLoop]: Abstraction has 8948 states and 15264 transitions. [2025-02-05 15:37:24,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:37:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8948 states and 15264 transitions. [2025-02-05 15:37:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 15:37:24,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:24,673 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] [2025-02-05 15:37:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:37:24,673 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:24,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1947663851, now seen corresponding path program 1 times [2025-02-05 15:37:24,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099886334] [2025-02-05 15:37:24,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:24,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 15:37:24,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 15:37:24,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:24,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 15:37:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099886334] [2025-02-05 15:37:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099886334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308011627] [2025-02-05 15:37:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:24,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:24,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:24,743 INFO L87 Difference]: Start difference. First operand 8948 states and 15264 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:37:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:25,177 INFO L93 Difference]: Finished difference Result 17950 states and 31081 transitions. [2025-02-05 15:37:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:25,178 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-02-05 15:37:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:25,237 INFO L225 Difference]: With dead ends: 17950 [2025-02-05 15:37:25,237 INFO L226 Difference]: Without dead ends: 9020 [2025-02-05 15:37:25,281 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-02-05 15:37:25,282 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 12 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2495 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-02-05 15:37:25,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2495 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:25,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9020 states. [2025-02-05 15:37:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9020 to 8988. [2025-02-05 15:37:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8988 states, 6946 states have (on average 1.6099913619349266) internal successors, (11183), 7264 states have internal predecessors, (11183), 1600 states have call successors, (1600), 438 states have call predecessors, (1600), 441 states have return successors, (2501), 1565 states have call predecessors, (2501), 1590 states have call successors, (2501) [2025-02-05 15:37:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8988 states to 8988 states and 15284 transitions. [2025-02-05 15:37:25,684 INFO L78 Accepts]: Start accepts. Automaton has 8988 states and 15284 transitions. Word has length 84 [2025-02-05 15:37:25,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:25,685 INFO L471 AbstractCegarLoop]: Abstraction has 8988 states and 15284 transitions. [2025-02-05 15:37:25,685 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:37:25,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8988 states and 15284 transitions. [2025-02-05 15:37:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 15:37:25,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:25,687 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] [2025-02-05 15:37:25,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:37:25,688 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:25,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:25,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1261667104, now seen corresponding path program 1 times [2025-02-05 15:37:25,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:25,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693838897] [2025-02-05 15:37:25,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:25,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:25,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 15:37:25,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 15:37:25,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:25,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:37:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693838897] [2025-02-05 15:37:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693838897] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:25,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584752315] [2025-02-05 15:37:25,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:25,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:25,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:25,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:25,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:25,820 INFO L87 Difference]: Start difference. First operand 8988 states and 15284 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:37:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:26,646 INFO L93 Difference]: Finished difference Result 26987 states and 48345 transitions. [2025-02-05 15:37:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2025-02-05 15:37:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:26,781 INFO L225 Difference]: With dead ends: 26987 [2025-02-05 15:37:26,782 INFO L226 Difference]: Without dead ends: 18017 [2025-02-05 15:37:26,839 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-02-05 15:37:26,840 INFO L435 NwaCegarLoop]: 927 mSDtfsCounter, 841 mSDsluCounter, 3377 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:26,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 4304 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18017 states. [2025-02-05 15:37:27,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18017 to 17916. [2025-02-05 15:37:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17916 states, 13852 states have (on average 1.6070603522956974) internal successors, (22261), 14482 states have internal predecessors, (22261), 3178 states have call successors, (3178), 870 states have call predecessors, (3178), 885 states have return successors, (6322), 3123 states have call predecessors, (6322), 3160 states have call successors, (6322) [2025-02-05 15:37:27,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17916 states to 17916 states and 31761 transitions. [2025-02-05 15:37:27,648 INFO L78 Accepts]: Start accepts. Automaton has 17916 states and 31761 transitions. Word has length 93 [2025-02-05 15:37:27,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:27,650 INFO L471 AbstractCegarLoop]: Abstraction has 17916 states and 31761 transitions. [2025-02-05 15:37:27,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 15:37:27,650 INFO L276 IsEmpty]: Start isEmpty. Operand 17916 states and 31761 transitions. [2025-02-05 15:37:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:37:27,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:27,652 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] [2025-02-05 15:37:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:37:27,652 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:27,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1561710441, now seen corresponding path program 1 times [2025-02-05 15:37:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587035442] [2025-02-05 15:37:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:27,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:37:27,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:37:27,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:27,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 15:37:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587035442] [2025-02-05 15:37:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587035442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014632067] [2025-02-05 15:37:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:27,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:27,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:27,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:27,748 INFO L87 Difference]: Start difference. First operand 17916 states and 31761 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-05 15:37:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:28,584 INFO L93 Difference]: Finished difference Result 35958 states and 65266 transitions. [2025-02-05 15:37:28,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:28,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 94 [2025-02-05 15:37:28,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:28,689 INFO L225 Difference]: With dead ends: 35958 [2025-02-05 15:37:28,689 INFO L226 Difference]: Without dead ends: 18060 [2025-02-05 15:37:28,786 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-02-05 15:37:28,787 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 11 mSDsluCounter, 1658 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2498 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-02-05 15:37:28,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2498 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18060 states. [2025-02-05 15:37:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18060 to 17996. [2025-02-05 15:37:29,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17996 states, 13924 states have (on average 1.6044958345303073) internal successors, (22341), 14554 states have internal predecessors, (22341), 3178 states have call successors, (3178), 886 states have call predecessors, (3178), 893 states have return successors, (6294), 3115 states have call predecessors, (6294), 3160 states have call successors, (6294) [2025-02-05 15:37:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17996 states to 17996 states and 31813 transitions. [2025-02-05 15:37:29,651 INFO L78 Accepts]: Start accepts. Automaton has 17996 states and 31813 transitions. Word has length 94 [2025-02-05 15:37:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:29,652 INFO L471 AbstractCegarLoop]: Abstraction has 17996 states and 31813 transitions. [2025-02-05 15:37:29,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-02-05 15:37:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 17996 states and 31813 transitions. [2025-02-05 15:37:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 15:37:29,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:29,654 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] [2025-02-05 15:37:29,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:37:29,655 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:29,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:29,656 INFO L85 PathProgramCache]: Analyzing trace with hash 702101118, now seen corresponding path program 1 times [2025-02-05 15:37:29,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:29,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252297436] [2025-02-05 15:37:29,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:29,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:29,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 15:37:29,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 15:37:29,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:29,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:29,767 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:37:29,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:29,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252297436] [2025-02-05 15:37:29,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252297436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:29,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:29,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 15:37:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480113765] [2025-02-05 15:37:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:29,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:37:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:29,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:37:29,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:37:29,769 INFO L87 Difference]: Start difference. First operand 17996 states and 31813 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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-02-05 15:37:31,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:31,032 INFO L93 Difference]: Finished difference Result 54131 states and 103424 transitions. [2025-02-05 15:37:31,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:37:31,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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 104 [2025-02-05 15:37:31,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:31,481 INFO L225 Difference]: With dead ends: 54131 [2025-02-05 15:37:31,481 INFO L226 Difference]: Without dead ends: 36153 [2025-02-05 15:37:31,566 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-02-05 15:37:31,568 INFO L435 NwaCegarLoop]: 917 mSDtfsCounter, 836 mSDsluCounter, 3354 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 4271 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:31,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 4271 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:37:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36153 states. [2025-02-05 15:37:32,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36153 to 35988. [2025-02-05 15:37:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35988 states, 27850 states have (on average 1.6021184919210054) internal successors, (44619), 29104 states have internal predecessors, (44619), 6340 states have call successors, (6340), 1766 states have call predecessors, (6340), 1797 states have return successors, (16763), 6237 states have call predecessors, (16763), 6306 states have call successors, (16763) [2025-02-05 15:37:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35988 states to 35988 states and 67722 transitions. [2025-02-05 15:37:33,225 INFO L78 Accepts]: Start accepts. Automaton has 35988 states and 67722 transitions. Word has length 104 [2025-02-05 15:37:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:33,226 INFO L471 AbstractCegarLoop]: Abstraction has 35988 states and 67722 transitions. [2025-02-05 15:37:33,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 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-02-05 15:37:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 35988 states and 67722 transitions. [2025-02-05 15:37:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 15:37:33,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:33,229 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] [2025-02-05 15:37:33,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:37:33,229 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:33,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:33,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1749749294, now seen corresponding path program 1 times [2025-02-05 15:37:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652298632] [2025-02-05 15:37:33,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:33,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:33,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 15:37:33,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 15:37:33,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:33,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:33,314 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:37:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:33,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652298632] [2025-02-05 15:37:33,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652298632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:33,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:33,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 15:37:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496789150] [2025-02-05 15:37:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:33,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:37:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:33,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:37:33,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:37:33,316 INFO L87 Difference]: Start difference. First operand 35988 states and 67722 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:37:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:34,952 INFO L93 Difference]: Finished difference Result 72278 states and 141091 transitions. [2025-02-05 15:37:34,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2025-02-05 15:37:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:35,263 INFO L225 Difference]: With dead ends: 72278 [2025-02-05 15:37:35,263 INFO L226 Difference]: Without dead ends: 36308 [2025-02-05 15:37:35,511 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-02-05 15:37:35,513 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 9 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2495 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:35,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2495 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:37:35,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36308 states. [2025-02-05 15:37:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36308 to 36180. [2025-02-05 15:37:37,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36180 states, 28026 states have (on average 1.598908156711625) internal successors, (44811), 29280 states have internal predecessors, (44811), 6340 states have call successors, (6340), 1798 states have call predecessors, (6340), 1813 states have return successors, (16731), 6221 states have call predecessors, (16731), 6306 states have call successors, (16731) [2025-02-05 15:37:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36180 states to 36180 states and 67882 transitions. [2025-02-05 15:37:37,569 INFO L78 Accepts]: Start accepts. Automaton has 36180 states and 67882 transitions. Word has length 105 [2025-02-05 15:37:37,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:37,570 INFO L471 AbstractCegarLoop]: Abstraction has 36180 states and 67882 transitions. [2025-02-05 15:37:37,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-02-05 15:37:37,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36180 states and 67882 transitions. [2025-02-05 15:37:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 15:37:37,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:37,574 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:37:37,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:37:37,574 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:37,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1098773642, now seen corresponding path program 1 times [2025-02-05 15:37:37,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671613952] [2025-02-05 15:37:37,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:37,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:37,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:37:37,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:37:37,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:37,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 15:37:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671613952] [2025-02-05 15:37:37,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671613952] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:37:37,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985024470] [2025-02-05 15:37:37,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:37,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:37:37,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:37:37,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:37:37,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:37:37,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 15:37:38,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 15:37:38,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:38,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:38,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1862 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:37:38,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:37:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:37:38,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:37:38,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985024470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:38,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:37:38,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-02-05 15:37:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648980367] [2025-02-05 15:37:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:38,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:37:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:38,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:37:38,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:37:38,237 INFO L87 Difference]: Start difference. First operand 36180 states and 67882 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:37:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:45,390 INFO L93 Difference]: Finished difference Result 129505 states and 264194 transitions. [2025-02-05 15:37:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 15:37:45,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 140 [2025-02-05 15:37:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:46,358 INFO L225 Difference]: With dead ends: 129505 [2025-02-05 15:37:46,359 INFO L226 Difference]: Without dead ends: 93343 [2025-02-05 15:37:46,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-02-05 15:37:46,615 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 2405 mSDsluCounter, 1857 mSDsCounter, 0 mSdLazyCounter, 6368 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2572 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 6858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 6368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:46,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2572 Valid, 2459 Invalid, 6858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 6368 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 15:37:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93343 states. [2025-02-05 15:37:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93343 to 92070. [2025-02-05 15:37:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92070 states, 71400 states have (on average 1.5907422969187675) internal successors, (113579), 74438 states have internal predecessors, (113579), 15880 states have call successors, (15880), 4502 states have call predecessors, (15880), 4789 states have return successors, (52056), 15865 states have call predecessors, (52056), 15814 states have call successors, (52056) [2025-02-05 15:37:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92070 states to 92070 states and 181515 transitions. [2025-02-05 15:37:51,545 INFO L78 Accepts]: Start accepts. Automaton has 92070 states and 181515 transitions. Word has length 140 [2025-02-05 15:37:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:37:51,545 INFO L471 AbstractCegarLoop]: Abstraction has 92070 states and 181515 transitions. [2025-02-05 15:37:51,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-02-05 15:37:51,546 INFO L276 IsEmpty]: Start isEmpty. Operand 92070 states and 181515 transitions. [2025-02-05 15:37:51,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 15:37:51,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:37:51,547 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] [2025-02-05 15:37:51,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:37:51,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-02-05 15:37:51,749 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:37:51,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:37:51,750 INFO L85 PathProgramCache]: Analyzing trace with hash -971717961, now seen corresponding path program 1 times [2025-02-05 15:37:51,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:37:51,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179997365] [2025-02-05 15:37:51,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:37:51,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:37:51,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 15:37:51,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 15:37:51,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:37:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:37:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-02-05 15:37:51,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:37:51,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179997365] [2025-02-05 15:37:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179997365] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:37:51,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:37:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:37:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375368359] [2025-02-05 15:37:51,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:37:51,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:37:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:37:51,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:37:51,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:37:51,985 INFO L87 Difference]: Start difference. First operand 92070 states and 181515 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-05 15:37:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:37:57,159 INFO L93 Difference]: Finished difference Result 186678 states and 371418 transitions. [2025-02-05 15:37:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:37:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2025-02-05 15:37:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:37:58,078 INFO L225 Difference]: With dead ends: 186678 [2025-02-05 15:37:58,079 INFO L226 Difference]: Without dead ends: 94578 [2025-02-05 15:37:58,909 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-02-05 15:37:58,910 INFO L435 NwaCegarLoop]: 900 mSDtfsCounter, 696 mSDsluCounter, 2568 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:37:58,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 3468 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:37:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94578 states. [2025-02-05 15:38:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94578 to 94415. [2025-02-05 15:38:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94415 states, 73277 states have (on average 1.583552820120911) internal successors, (116038), 76380 states have internal predecessors, (116038), 16197 states have call successors, (16197), 4668 states have call predecessors, (16197), 4940 states have return successors, (52540), 16089 states have call predecessors, (52540), 16131 states have call successors, (52540)